贪心算法
_花花
这个作者很懒,什么都没留下…
展开
-
HDU 2037 今年暑假不AC
今年暑假不ACTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19995 Accepted Submission(s): 10431Problem Description“今年暑假不AC?”“是的。”“原创 2013-06-07 20:11:49 · 861 阅读 · 0 评论 -
HDU 12O3 I NEED A OFFER!
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12030 Accepted Submission(s): 4609Problem DescriptionSpeakless很早就想原创 2013-06-11 10:30:09 · 1001 阅读 · 0 评论 -
UVA11292 The Dragon of Loowater
The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turnedinto a major problem.The shores of Rellau Creek in central Loowater had always been a primebreeding groun原创 2013-07-15 21:05:29 · 821 阅读 · 0 评论 -
UVA11729 Commando War
Commando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from thefront never cameBy evening the sound of the gunfire was miles awayAh softl原创 2013-07-15 21:40:39 · 774 阅读 · 0 评论 -
HDU1009 FatMouse' Trade
FatMouse' Trade解题思路:本题为典型贪心算法题目,由于物品可分割,不能用01背包做。 先对给出的各个仓库的信息(豆子量,所需猫粮量)进行分析,可知仓库中豆子越多,所需猫粮越少,则越划得来,兑换该房间的豆子可以得到最大的豆子量。 因此,先求出各个仓库的豆子量/所需猫粮量的比值(简称比值),比值大的应该考虑优先兑换。原创 2013-08-03 15:59:41 · 1189 阅读 · 0 评论 -
HDU1051 Wooden Sticks
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9125 Accepted Submission(s): 3729Problem DescriptionThere is a pile原创 2013-08-06 09:10:48 · 911 阅读 · 0 评论 -
HDU4544 湫湫系列故事——消灭兔子
湫湫系列故事——消灭兔子Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1267 Accepted Submission(s): 433Problem Description 湫湫减肥 越减越肥!原创 2013-08-07 21:59:48 · 1104 阅读 · 0 评论 -
Shoemaker's Problem
Shoemaker's Problem本题为贪心算法题,不要想多了,就只是一个贪心算法。一个"鞋匠",有n件工作要做,每件工作需要做Ti天,从第一天开始,到开始做该工作的这段时间,每天要付Si元费用。问按怎样一个顺序做能让鞋匠付的钱最少。每一件工作,开始的时间越晚,需要付的钱(对于该项工作来说)就越多。做完所有工作的时间是不变的,但是工作的顺序是可变的。而没件工作的罚款比率不同(天数每天罚钱数的比)。对于所有的工作来说,比率越小的,放在越前面做,总体罚钱的数就会越少。所以,我们只要算出比率,排序原创 2013-09-11 19:56:30 · 1213 阅读 · 0 评论