随笔分类 -  贪心

HDU 4726 Kia's Calculation(贪心)
摘要:Kia's CalculationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 83Accepted Submission(s): 16Problem DescriptionDoctor Ghee is teaching Kia how to calculate the sum of two integers. But Kia is so careless and alway forget to carry a number when 阅读全文

posted @ 2013-09-11 17:46 kuangbin 阅读(1687) 评论(0) 推荐(0) 编辑

HDU 4550 卡片游戏(贪心)
摘要:卡片游戏Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 376Accepted Submission(s): 115Problem Description 小明最近宅在家里无聊,于是他发明了一种有趣的游戏,游戏道具是N张叠在一起的卡片,每张卡片上都有一个数字,数字的范围是0~9,游戏规则如下: 首先取最上方的卡片放到桌子上,然后每次取最上方的卡片,放到桌子上已有卡片序列的最右边或者最左边。当N张卡片全部都放到桌子上后,桌子上的N张卡片构成了.. 阅读全文

posted @ 2013-05-21 00:59 kuangbin 阅读(1561) 评论(0) 推荐(0) 编辑

Uva 11729 Commando War (贪心,排序)
摘要:There is a war and it doesn't look very promising for your country. Now it's time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. You have N soldiers in your squad. In your master-plan, every single soldier has a unique res 阅读全文

posted @ 2012-10-24 00:30 kuangbin 阅读(1345) 评论(0) 推荐(0) 编辑

Uva 11292 The Dragon of Loowater(排序后贪心)
摘要:Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the geese population was out of control. The peo 阅读全文

posted @ 2012-10-24 00:09 kuangbin 阅读(2077) 评论(0) 推荐(3) 编辑

HDU 1052 Tian Ji -- The Horse Racing (贪心)
摘要:Tian Ji -- The Horse RacingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11572Accepted Submission(s): 3239Problem DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the 阅读全文

posted @ 2012-10-23 16:59 kuangbin 阅读(2079) 评论(0) 推荐(0) 编辑

ZOJ 3657 The Little Girl who Picks Mushrooms 第37届ACM/ICPC长春赛区现场赛C题(水题)
摘要:The Little Girl who Picks MushroomsTime Limit: 2 Seconds Memory Limit: 32768 KBIt's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. She brought five bags with her and used different bags to collect mushrooms from different mountains. Each b 阅读全文

posted @ 2012-10-16 11:07 kuangbin 阅读(1368) 评论(2) 推荐(0) 编辑

HDU 4296 Buildings 第37届ACM/ICPC 成都赛区网络赛1009题 (贪心)
摘要:BuildingsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 155Accepted Submission(s): 72Problem Description Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accomplished many great projects. 阅读全文

posted @ 2012-09-16 19:36 kuangbin 阅读(842) 评论(0) 推荐(0) 编辑

HDU 4221 Greedy?(贪心)
摘要:Greedy?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 908Accepted Submission(s): 284Problem DescriptioniSea is going to be CRAZY! Recently, he was assigned a lot of works to do, so many that you can't imagine. Each task costs Ci time as least, 阅读全文

posted @ 2012-09-05 23:30 kuangbin 阅读(1176) 评论(0) 推荐(0) 编辑

HDU 4398 Template Library Management(贪心,STL)
摘要:Template Library ManagementTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 298Accepted Submission(s): 87Problem DescriptionAs an experienced ACMer, you must have known the importance of "code template library". With the help of pre-printe 阅读全文

posted @ 2012-08-27 18:40 kuangbin 阅读(764) 评论(0) 推荐(0) 编辑

POJ 2940 Wine Trading in Gergovia(简单贪心)
摘要:Wine Trading in GergoviaTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2765Accepted: 1245DescriptionAs you may know from the comic “Asterix and the Chieftain’s Shield”, Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? 阅读全文

posted @ 2012-08-22 18:44 kuangbin 阅读(769) 评论(0) 推荐(0) 编辑

ACM HDU 1257 最少拦截系统 (贪心) by kuangbin
摘要:最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9039Accepted Submission(s): 3514Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几套 阅读全文

posted @ 2012-08-03 10:18 kuangbin 阅读(18203) 评论(6) 推荐(4) 编辑

导航

JAVASCRIPT: