hdu 1520 Anniversary party 树形dp水题
2016-04-06 19:32
423 查看
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 |
公司举行晚会,要求不能有两个是直属上下级的员工同时出现,求最大开心度。
水题,不解释。
#include<cstdio> #include<cstring> #include<algorithm> #include<vector> #include<stack> using namespace std; const int MAXM = 6005; const int MAXN = 6005; struct Edge { int to,next; } edge[MAXM]; int head[MAXN],tot; void addedge(int u,int v) { edge[tot].to = v; edge[tot].next = head[u]; head[u] = tot++; } void init() { tot = 0; memset(head,-1,sizeof(head)); } int n,m; int dp[MAXN][2]; int p[MAXN]={0}; int dfs(int u,int go) { if(dp[u][go]!=-1) return dp[u][go]; if(go) dp[u][go] = p[u]; else dp[u][go] = 0; for(int e=head[u];e!=-1;e=edge[e].next) { int v = edge[e].to; if(go) dp[u][go] += dfs(v,0); else dp[u][go] += max(dfs(v,0),dfs(v,1)); } //printf("%d %d %d\n",u,go,dp[u][go]); return dp[u][go]; } int main() { int u,v; while(scanf("%d",&n)!=EOF) { init(); memset(dp,-1,sizeof(dp)); for(int i=1;i<=n;i++) scanf("%d",&p[i]); bool vis[MAXN]; memset(vis,0,sizeof(vis)); while(1) { scanf("%d%d",&u,&v); if(u==0) break; addedge(v,u); vis[u] = 1; } for(int i=1;i<=n;i++) { if(!vis[i]) addedge(0,i); } printf("%d\n",dfs(0,0)); } return 0; }
相关文章推荐
- 最大联通子数组
- 色彩
- Comet4J简介
- EL表达式的作用-执行运算
- Oracle 外连接和 (+)号的用法
- Mac 端安装Cocoapod
- LeetCode *** 238. Product of Array Except Self
- hihoCoder[Offer收割]编程练习赛3题目解析
- java学习第七天
- HashMap<String, ArrayList<Integer>>用法
- 数组问题(三)求二维整形数组最大联通子数组的和
- 20160406javaweb JDBC 实例工具类
- 【转】站内信设计思路
- android中%1$s、%1$d的用法
- 自顶向下的归并排序和自底向上的归并排序
- Ubuntu Codeblocks
- 1023_字符串排序
- RabbitMQ消息队列(九):Publisher的消息确认机制
- Froont!在线可视化响应式网页设计工具
- HashMap、ConcurrentHashMap、HashTable、HashSet