整数域二分搜索算法的边界问题

The Boundary Problem of Binary Search Algorithm in Integer Domain

二分搜索算法的运用非常普遍,但是最终能够写对二分的选手不多.在各级各类的NOI赛制比赛中,因二分算法边界问题导致丢分甚至爆零的现象也屡见不鲜.本文就整数域上的二分算法边界问题进行了研究,并通过具体的案例加以分析说明和小结.

Binary search algorithms are widely used, but few players can write binary correctly. In all kinds of NOI competitions, it is common to lose points or score zero point due to binary algorithm boundary problem. This paper studies the boundary problem of binary algorithm in integer domain, and analyzes and summarizes it through specific cases.