
Greedy
文章平均质量分 74
bingsanchun
这个作者很懒,什么都没留下…
展开
-
UVA 11389——The Bus Driver Problem
原题: In a city there are n bus drivers. Also there are n morning bus routes &nafternoon bus routes with various lengths. Each driver is assigned one morning route & one evening route. Fo原创 2013-04-15 21:02:55 · 1315 阅读 · 0 评论 -
“今年暑假不AC”解题报告
原题: Problem Description “今年暑假不AC?” “是的。” “那你干什么呢?” “看世界杯呀,笨蛋!” “@#$%^&*%...” 确实如此,世界杯来了,球迷的节日也来了,估计很多ACMer也会抛开电脑,奔向电视了。 作为球迷,一定想看尽量多的完整的比赛,当然,作为新时代的好青年,你一定还会看一些其它的节目,比如新闻联播(永远不要忘记关心国家大事)、非常6+7、超级女生,以原创 2013-01-22 13:14:13 · 926 阅读 · 0 评论 -
赚经验
题目描述 小明在玩一款电脑游戏,里面有一关是这样的: 战场上有n个敌人,小明必须把他们全部打败才能通过这关,不过战斗顺序可以小明自己决定。小明如果打败一个比自己经验值高的敌人,那么小明会赚取2点经验值,否则赚取1点经验值。 现在给你小明初始时的经验值和n个敌人的经验值,你能计算出小明最后经验值最高可以到多少吗? 输入格式 输入包含多组测试数据。 每组第一行输入两个正整数N(N 接原创 2013-07-27 23:33:12 · 1158 阅读 · 0 评论 -
FatMouse' Trade 解题报告
原题: Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room con原创 2013-01-22 13:33:22 · 952 阅读 · 0 评论 -
UVA11292-Dragon of Loowater
Once 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 th原创 2013-10-16 11:03:47 · 867 阅读 · 0 评论 -
UVA11729 - 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. Y原创 2013-10-17 00:23:56 · 1478 阅读 · 0 评论 -
UVA11300——Spreading the Wealth (贪心+建模)
Problem A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all of their properties to coin原创 2013-10-21 18:52:48 · 1285 阅读 · 0 评论 -
FZU2138-久违的月赛之一
Problem Description 好久没举月赛了,这次lqw给大家出了5道题,因为hsy学长宣传的很到位,吸引了n个DDMM们来做,另一位kk学长说,全做对的要给金奖,做对4题要给银奖,做对3题要给铜奖。统计数据的时候,发现每题分别在n个人中有n1、n2、n3、n4、n5个人通过,lqw灵机一动,问kk:“你猜,这次至少会有多少个人获奖?”由于题目太简单了,每题的通过人数一定大于等于最原创 2013-12-15 21:07:19 · 9734 阅读 · 0 评论