二分
int binary_search(int l,int r)
{
while(l<r)
{
int mid=(l+r)/2;
if(check(mid) )
r=mid;
else l = mid+1;
}
return l;
}
int binary_search_2(int l,int r)
{
while(l<r)
{
int mid = (l+r+1)/2;
if(check(mid)) l = mid;
else r=mid-1;
return l
}
}