标签：else arch 二分 arc ret search turn check int
int bsearch()
{
int left=0,right=maxn,mid;
while(left+1<right)
{
mid=(left+right)/2;
if(check(mid)) right=mid;
else left=mid;
}
if(check(left)) return left;
else return right;
}
标签：else arch 二分 arc ret search turn check int
原文地址：http://www.cnblogs.com/ywjblog/p/7661308.html
