背包
文章平均质量分 77
ciel_s
这个作者很懒,什么都没留下…
展开
-
poj 2486 Apple Tree (树形dp)
DescriptionWshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at o原创 2017-02-22 23:08:04 · 252 阅读 · 0 评论 -
hdu 4003 Find Metal Mineral(树形dp+分组背包)
Problem DescriptionHumans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them which formed a tree. Now Humans launches k robots on原创 2017-02-23 19:08:14 · 289 阅读 · 0 评论 -
hdu 1712 ACboy needs your help(分组背包)
Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arran原创 2017-02-15 13:48:07 · 296 阅读 · 0 评论 -
hdu 1561 The more, The Better(树形dp+分组背包)
Problem DescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗?Input 每个测试实例首先包括2个整数,N,M.(1 <= M <= N原创 2017-02-15 23:32:10 · 225 阅读 · 0 评论 -
hdu 1011 Starship Troopers (树形背包)
Problem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with原创 2017-02-24 15:25:55 · 235 阅读 · 0 评论 -
poj 1947 Rebuilding Roads (树形背包)
DescriptionThe cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn’t have time to rebuild any extra roads, so原创 2017-02-26 22:56:28 · 317 阅读 · 0 评论