二分查找
softrice
这个作者很懒,什么都没留下…
展开
-
HDU 2141——Can you find it?
二分查找把a[A]数组和b[B]数组相加,得到ab[A*B]。然后二分查找。#include#include#includeusing namespace std;#define maxn 504bool cmp(int a,int b){ return a<b; }int main(){ int a[maxn]; int b[maxn]; int ab[原创 2013-05-10 22:59:34 · 913 阅读 · 0 评论 -
One Chance To Be The God Of Chrysanthemum
One Chance To Be The God Of ChrysanthemumTime Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 59 Accepted Submission(s) : 3Font: Times New Roma原创 2013-07-19 11:11:00 · 860 阅读 · 0 评论 -
hdu 4738—— Caocao's Bridges
二分#include#include#includeusing namespace std;int a[110000][50];int n,m;int ans;int get(int l,int r){ int tmp=0; for(int i=1;i<=32;i++) if((a[r][i]-a[l-1][i])>=1) tmp+=(1<<(i-1));原创 2013-09-15 18:50:22 · 718 阅读 · 0 评论 -
A - A Careful Approach final
枚举飞机着陆的顺序,确定顺序后进行二分。#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define esp原创 2013-09-20 18:20:10 · 1327 阅读 · 0 评论