
二分
蒟蒻的ACMer
2014界大学新生
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2456 Aggressive cows 二分
Aggressive cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8731 Accepted: 4338 Description Farmer John has built a new long barn, with N (2 His C原创 2015-10-09 21:02:09 · 615 阅读 · 0 评论 -
HLG 1293 取数 二分
取数 Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 333(69 users) Total Accepted: 79(51 users) Rating: Special Judge: No Description 有n个整数,给原创 2015-10-08 18:57:42 · 735 阅读 · 0 评论 -
HLG 1039 修路 二分
修路 Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 335(159 users) Total Accepted: 190(150 users) Rating: Special Judge: No Description 前段时间,某原创 2015-10-05 20:20:54 · 786 阅读 · 0 评论 -
POJ 1905 Expanding Rods 几何加二分
Expanding Rods Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 13735 Accepted: 3550 Description When a thin rod of length L is heated n degrees, it expands原创 2015-09-24 14:14:08 · 596 阅读 · 0 评论 -
POJ 2503 Babelfish qsort+bserach OR 字典树
Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 36951 Accepted: 15743 Description You have just moved from Waterloo to a big city. The people her原创 2015-08-19 17:33:09 · 1137 阅读 · 0 评论 -
poj 3273 二分
n个数分为最多m段 如何分能让最大段最小 二分答案然后判断 ACcode: #include #include #include #include using namespace std; int n,m,l,r,mid; int a[100005]; int fun(int x){ int t=1,tmp=0; for(int i=1;i<=n;++i){原创 2017-03-31 20:41:09 · 258 阅读 · 0 评论