码迷,mamicode.com
首页 >  
搜索关键字:candy 分糖果    ( 334个结果
HDU 5380 Travel with candy (单调队列&贪心)
本文纯属原创,转载请注明出处。http://blog.csdn.net/zip_fan,谢谢。 题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=5380。 Travel with candy Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (...
分类:其他好文   时间:2015-08-16 16:41:33    阅读次数:269
POJ-3083 Children of the Candy Corn (BFS+DFS)
DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-...
分类:其他好文   时间:2015-08-16 16:37:35    阅读次数:112
hdu 5380 Travel with candy(双端队列)
题目链接:hdu 5380 Travel with candy 保持油箱一直处于满的状态,维护一个队列,记录当前C的油量中分别可以以多少价格退货,以及可以推货的量。每到一个位置,可以该商店的sell值更新队列中所有价格小于sell的(还没有卖)。用buy值更新队列中大于buy(卖掉了)。移动所消耗的油从价格最低的开始。 #include #include #include ...
分类:其他好文   时间:2015-08-15 11:56:37    阅读次数:202
HDU-1034(简单模拟)
Candy Sharing GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionA number of students sit in a circ...
分类:其他好文   时间:2015-08-14 13:14:22    阅读次数:110
hdoj-1034-Candy Sharing Game
Candy Sharing Game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3812 Accepted Submission(s): 2377 Problem Description A number of stude...
分类:其他好文   时间:2015-08-10 18:12:23    阅读次数:126
Flipping elements with WPF
http://yichuanshen.de/blog/2010/11/13/flipping-elements-with-wpf/Have you already seen ForgottenTime’s new flip animation eye candy? If not, it’s abou...
分类:Windows程序   时间:2015-08-05 12:37:03    阅读次数:595
hdu5127
非常卡时间,不能用set 而却糖果是不会重的,之前认为会重也一直超时 别忘了清空,不清空也会超时 #include using namespace std; typedef pair candy; list s; int main() { int n; while( scanf("%d",&n) && n ){ s.clear(); wh...
分类:其他好文   时间:2015-08-03 10:11:54    阅读次数:255
[LeetCode][Java] Candy
题目: There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following requirements: Each child must have at...
分类:编程语言   时间:2015-08-01 23:40:01    阅读次数:221
hdu 5291 Candy Distribution(dp)
题目链接:hdu 5291 Candy Distribution 每次先计算出dp[0],然后根据dp[0]的数值可以用o(1)的复杂度算出dp[1],以此类推。总体复杂度为o(200 * 80000),可以接受。 #include #include #include using namespace std; const int maxn = 80000; const int maxm...
分类:其他好文   时间:2015-07-28 21:06:14    阅读次数:187
POJ 3083 Children of the Candy Corn(搜索)
Children of the Candy Corn Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10975   Accepted: 4731 Description The cornfield maze is a popular Halloween treat...
分类:其他好文   时间:2015-07-28 10:47:44    阅读次数:103
334条   上一页 1 ... 17 18 19 20 21 ... 34 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!