二分
cpp
//找最左边
while(l<r){
int mid=l+r>>1;
if(check(mid))r=mid;
else l=mid+1;
}
//找最右边
while(l<r){
int mid=l+r>>1;
if(check(mid))l=mid;
else r=mid-1;
}