标签：turn arc class ons cto lse bsp const search
int binary_search(const vector<int>& stones,int val){ int sz=stones.size(); int l=0,r=sz-1; while(l<=r){ int mid=(l+r)>>1; if(stones[mid]>=val){ r=mid-1; }else{ l=mid+1; } } return l; }
标签：turn arc class ons cto lse bsp const search
原文地址：https://www.cnblogs.com/itcsl/p/9097145.html
