hdu_1520_树形dp
来源:互联网 发布:中控考勤软件 编辑:程序博客网 时间:2024/04/28 14:14
Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3930 Accepted Submission(s): 1830
Problem Description
There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tree rooted at the rector V. E. Tretyakov. In order to make the party funny for every one, the rector does not want both an employee and his or her immediate supervisor to be present. The personnel office has evaluated conviviality of each employee, so everyone has some number (rating) attached to him or her. Your task is to make a list of guests with the maximal possible sum of guests' conviviality ratings.
Input
Employees are numbered from 1 to N. A first line of input contains a number N. 1 <= N <= 6 000. Each of the subsequent N lines contains the conviviality rating of the corresponding employee. Conviviality rating is an integer number in a range from -128 to 127. After that go T lines that describe a supervisor relation tree. Each line of the tree specification has the form:
L K
It means that the K-th employee is an immediate supervisor of the L-th employee. Input is ended with the line
0 0
L K
It means that the K-th employee is an immediate supervisor of the L-th employee. Input is ended with the line
0 0
Output
Output should contain the maximal sum of guests' ratings.
Sample Input
711111111 32 36 47 44 53 50 0
Sample Output
5#include <iostream>#include <cstdio>#include <cstring>#include <vector>#define max(a, b) (a) > (b) ? (a) : (b)using namespace std;int dp[6010][2];bool visit[6010];int val[6010];int n;vector<int >map[6010];void tree_dp(int num){if (visit[num])return ;visit[num] = 1;for (int i = 0; i < map[num].size(); i++){int k = map[num][i];if (!visit[k]){tree_dp(k);dp[num][1] += dp[k][0];dp[num][0] += max(dp[k][0], dp[k][1]);}}dp[num][1] += val[num];}int main(){while (scanf("%d", &n) != EOF){memset(dp, 0, sizeof (dp));memset(visit, 0, sizeof (visit));memset(val, 0, sizeof (val));for (int i = 1; i <= n; i++){scanf("%d", &val[i]);map[i].clear();}int a, b;while (scanf("%d%d", &a, &b) != EOF && a + b){map[a].push_back(b);map[b].push_back(a);}tree_dp(1);printf("%d\n", max(dp[1][1], dp[1][0]));}return 0;}
0 0
- hdu_1520_树形dp
- 树形dp
- 树形DP
- 树形dp
- 树形DP
- 树形dp
- 树形DP
- 树形DP
- 树形DP
- 树形DP
- 树形dp
- 树形dp
- 树形dp
- 树形dp
- 树形DP
- 树形DP
- 树形DP
- 树形DP
- crack the code interview 4.4
- 18. 微软面试题:输入一个表示整数的字符串,把该字符串转换成整数并输出
- Centos6.3下安装配置Trac和Subversion(SVN)全过程!(一)
- 【matlab编程】matlab随机数函数
- 瀑布流布局的三种实现方式
- hdu_1520_树形dp
- crack the code interview 4.5
- crack the code interview 4.6
- C++学习笔记(1)--《程序员的自我修养--链接、装载、库》笔记
- hdu 1083 Courses (简单二分匹配)
- bfs知识点
- Zedgraph用法
- 永远怀念Steve Jobs——时代的先驱者
- crack the code interview 4.7