【HDU1520】【Anniversary party】
2015-08-04 20:28
357 查看
Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6633 Accepted Submission(s): 2953
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
Output
Output should contain the maximal sum of guests' ratings.
Sample Input
7 1 1 1 1 1 1 1 1 3 2 3 6 4 7 4 4 5 3 5 0 0
Sample Output
5
Source
Ural State University
Internal Contest October'2000 Students Session
Recommend
linle
#include <iostream> #include <cstring> #include <cmath> #include <queue> #include <stack> #include <list> #include <map> #include <set> #include <string> #include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; int n; const int N = 6010; int a ; int dp [2]; int g ; bool vis ; void dfs(int u) { vis[u] = true; dp[u][1] = a[u]; for(int i=1;i<=g[u][0];i++) { int v = g[u][i]; if(vis[v]) continue; dfs(v); dp[u][1] += dp[v][0]; dp[u][0] += max(dp[v][0],dp[v][1]); } } int main() { while(scanf("%d",&n) != EOF) { for(int i=1;i<=n;i++) { scanf("%d",&a[i]); vis[i] = g[i][0] = 0; } int u,v; while(scanf("%d%d",&u,&v)) { if(u == 0 && v == 0) break; g[u][++g[u][0]] = v; g[v][++g[v][0]] = u; } memset(dp,0,sizeof(dp)); dfs(1); printf("%d\n",max(dp[1][0],dp[1][1])); } return 0; }
相关文章推荐
- 【数位dp】
- 数据类型范围【常识性编码知识】
- Mysql在大型网站的应用架构演变
- Spring基于 Annotation 的简单介绍
- 【数字加减】
- 【HDU1513】【Palindrome】
- 杀死指定的一个shell脚本
- C语言编程入门——综合练习(四)上机考试题
- Python日期时间Date/Time
- JAVA同步机制中用到的锁的思想
- 最大似然估计法
- 剑指Offer面试题24(Java版):二叉搜索树的后序遍历序列
- 回调函数和发消息的作用比较
- SDUToj1138数据结构上机测试2-1:单链表操作A
- python中package注意事项
- HDOJ Seeding (DFS)
- Using XILINX IP Core Block RAM (2)
- 自定义卡片翻转动画
- Unity (一)
- HDU-1506 || HDU-1505 || HDU-2870 || HDU-2830