hdu 1011 树形dp
2016-05-20 22:13
447 查看
Starship Troopers
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16467 Accepted Submission(s): 4396
[align=left]Problem Description[/align]
You, 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 tunnels. Each room is occupied by some bugs, and their brains hide in some of the rooms. Scientists have just developed a new weapon and want to experiment it on some brains. Your task is to destroy the whole base, and capture as many brains as possible.
To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each room from the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.
A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. You need the help of a computer.
[align=left]Input[/align]
The input contains several test cases. The first line of each test case contains two integers N (0 < N <= 100) and M (0 <= M <= 100), which are the number of rooms in the cavern and the number of starship troopers you have, respectively. The following N lines give the description of the rooms. Each line contains two non-negative integers -- the amount of bugs inside and the possibility of containing a brain, respectively. The next N - 1 lines give the description of tunnels. Each tunnel is described by two integers, which are the indices of the two rooms it connects. Rooms are numbered from 1 and room 1 is the entrance to the cavern.
The last test case is followed by two -1's.
[align=left]Output[/align]
For each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.
[align=left]Sample Input[/align]
5 10
50 10
40 10
40 20
65 30
70 30
1 2
1 3
2 4
2 5
1 1
20 7
-1 -1
[align=left]Sample Output[/align]
50
7
[align=left]Author[/align]
XU, Chuan
简单的dp,其实并不简单,我做了有一段时间。dp的题做了没几个。但是dp都是特别神奇的东西。
简单的说一下这道题的思路:
首先用vector 保存这颗树,然后用dfs记录来遍历整个树。
dp[i][j]=max(dp[i][j],dp[i][j-k]+dp[son][k].
dp[i][j]表示第i颗树用j个人能获得的最大的brain值。
相关文章推荐
- listView系列之优化问题
- 数据结构学习 队列 二叉树
- LRU缓存实现(Java)
- 匿名对象
- Java基础学习总结——Java对象的序列化和反序列化
- 细说new与malloc的10点区别
- HDU 5236 Article 经典概率dp 由一种状态推到另一种状态
- FusionCharts Suite XT统计图表使用笔记(1)--入门介绍
- 操作系统知识(8)--Shell(3)
- SwipeRefreshLayout第一次进入界面刷新不显示动画
- java中的native方法
- hitText方法和pointInside方法
- memcache的内存管理与删除机制
- 练习打字第十二天!
- 学习进度条11
- Callable接口实现多线程
- 将普通图片转化为字符画(Python)
- 整数数组按频率和大小排序
- Closeable和java7自动资源释放特性
- JAVA——System类