二分模板

Posted 2020-10-10 YuWenjue

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;
}