binary search template
low_bound()
1 int lower_bound(int *A,int x,int y,int v) 2 { 3 int m; 4 while(x<y) 5 { 6 m=(x+y)>>1; 7 if(A[m]>=v) y=m; 8 else x=m+1; 9 } 10 return x; 11 }
low_bound()
1 int lower_bound(int *A,int x,int y,int v) 2 { 3 int m; 4 while(x<y) 5 { 6 m=(x+y)>>1; 7 if(A[m]>=v) y=m; 8 else x=m+1; 9 } 10 return x; 11 }