二分
文章平均质量分 68
___fouzhe
这个作者很懒,什么都没留下…
展开
-
uvalive 4254(二分+模拟)
分析: 大方向是二分答案,对每一秒进行模拟,判断是否能够处理完在这个时刻可以处理的任务,可以用优先队列储存当前可以执行的任务。当队列中元素不为空且里面有的元素的结束时间小于当前秒时,不能处理完;当队列中元素为空且判断完所有元素时说明可以以该速度执行。 ac代码:#include<iostream>#include<cstdio>#include<algorithm>#include<que原创 2016-03-08 17:00:46 · 463 阅读 · 0 评论 -
poj 1064(简单二分)
题目: Description Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It原创 2016-03-09 18:38:32 · 304 阅读 · 0 评论 -
hdu4445Crazy Tank (二分)
题目链接题目描述: Crazy Tank was a famous game about ten years ago. Every child liked it. Time flies, children grow up, but the memory of happy childhood will never go.Now you’re controlling the tank Laotu on原创 2016-07-22 23:50:00 · 576 阅读 · 0 评论 -
Codeforces Round #379 (Div. 2)C. Anton and Making Potions(二分)
C. Anton and Making Potionstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is playing a very interes原创 2016-11-19 00:01:45 · 505 阅读 · 0 评论 -
gym100796C(想法题/二分+树形dp)
题目链接C. Minimax Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob's new favourite toy is a rooted原创 2017-02-17 23:01:43 · 474 阅读 · 0 评论 -
Codeforces Round #268 (Div. 1) C. Hack it!(二分+尺取/构造,好题)
C. Hack it!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle X has met the following problem recently.原创 2017-02-28 16:38:44 · 408 阅读 · 0 评论 -
Codeforces Round #352 (Div. 1) B. Robin Hood(想法+二分,好题)
题目链接B. Robin Hoodtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe all know the impressive story of Ro原创 2017-03-01 19:10:33 · 289 阅读 · 0 评论 -
gym101194 china final Problem D. Ice Cream Tower(二分)
题目链接Problem D. Ice Cream Tower Input file:Output file: Time limit:Standard InputStandard Ouptut6 secondsThe 2016 ACM-ICPC Asia China-Final ContestMr. Pa原创 2017-02-23 11:10:30 · 1313 阅读 · 0 评论 -
SPOJ-MINSUB - Largest Submatrix(单调栈,二分,好题)
题目链接MINSUB - Largest Submatrixno tags You are given an matrix M (consisting of nonnegative integers) and an integer K. For any submatrix of M' of M define min(M') to be the minimu原创 2017-01-25 11:10:09 · 660 阅读 · 0 评论