随笔分类 -  binary search

摘要:二分查找 1 #include 2 #define min(a,b) (a=a[i])14 sum+=(tmp-a[i])/c[i]+1;15 }16 return sum;17 }18 int main()19 {20 while(scanf("%d",&n)!=EOF)21 {22 for(int i=0;i>1;28 if(cal(mid)&1) r=mid;29 else l=mid+1;30 }31 if(l==1LL=a[i]&&l... 阅读全文
posted @ 2013-09-30 23:55 sooflow 阅读(205) 评论(0) 推荐(0)
摘要:low_bound() 1 int lower_bound(int *A,int x,int y,int v) 2 { 3 int m; 4 while(x>1; 7 if(A[m]>=v) y=m; 8 else x=m+1; 9 }10 return x;11 } 阅读全文
posted @ 2013-08-25 00:08 sooflow 阅读(83) 评论(0) 推荐(0)