二分
文章平均质量分 83
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
hdu 5412 CRB and Queries(动态求区间第k小+整体二分)
Problem Description There are N boys in CodeLand. Boy i has his coding skill Ai. CRB wants to know who has the suitable coding skill. So you should treat the following two types of queries.原创 2016-05-01 20:16:29 · 3674 阅读 · 0 评论 -
hdu 2104 K-th Number(静态求区间第k小+整体二分)
K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 46551 Accepted: 15539 Case Time Limit: 2000MS Description You are working for Macrohard c原创 2016-05-01 20:24:29 · 1150 阅读 · 0 评论 -
ZOJ 2112 Dynamic Rankings(动态求区间第k大+整体二分)
Dynamic Rankings Time Limit: 10 Seconds Memory Limit: 32768 KB The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply fi原创 2016-05-01 20:37:31 · 4638 阅读 · 0 评论 -
poj 3122 Pie (最大化平均值)
Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my p原创 2015-12-20 22:09:14 · 613 阅读 · 0 评论 -
codeforces 607 A Chain Reaction (二分)
There are n beacons located at distinct positions on a number line. The i-th beacon has position ai and power level bi. When the i-th beacon is activated, it destroys all beacons to its left (di原创 2016-03-10 21:43:04 · 378 阅读 · 0 评论 -
poj 2976 Dropping tests(最大化平均值)
Description In a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be . Given your test scores and a positive原创 2015-12-20 21:52:36 · 559 阅读 · 0 评论