模板实现如下:
int search(int l,int r){
int left=l,right=r;
int mid;
while(left<right){
mid=(left+right)>>1;
if(check(mid))left=mid+1;
else right=mid;
}
return left;
}
模板实现如下:
int search(int l,int r){
int left=l,right=r;
int mid;
while(left<right){
mid=(left+right)>>1;
if(check(mid))left=mid+1;
else right=mid;
}
return left;
}