hdu1520Anniversary party(比poj 2342数据强一些)
来源:互联网 发布:mac airdrop 编辑:程序博客网 时间:2024/06/15 21:38
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<algorithm>using namespace std;#define N 6005int dp[N][2],father[N];int n;int head[N] ;int num;struct stud{int to;int next;}e[N*2];void add(int s,int to){e[num].to=to;e[num].next=head[s];head[s]=num++;}void dfs(int x){ int i,j; for(i=head[x];i!=-1;i=e[i].next){int to=e[i].to;dfs(to);dp[x][1]+=dp[to][0];dp[x][0]+=max(dp[to][1],dp[to][0]);}}int main(){int i,j;while(~scanf("%d",&n)){memset(dp,0,sizeof(dp));memset(father,0,sizeof(father));memset(head,-1,sizeof(head));for(i=1;i<=n;i++)scanf("%d",&dp[i][1]);int s,e;num=0;while(scanf("%d%d",&s,&e),s+e){father[s]=e;add(e,s);}i=1;while(father[i])i=father[i] ;dfs(i);printf("%d\n",max(dp[i][1],dp[i][0]));}return 0;}
1 0
- hdu1520Anniversary party(比poj 2342数据强一些)
- HDU1520Anniversary party(入门树形DP)
- hdu1520Anniversary party (树形DP)
- hdu1520Anniversary party 树形dp水题
- poj2342&hdu1520Anniversary party【树型dp模板题】
- poj 2342 Anniversary Party(树形dp)
- POJ 2342 Anniversary party(树形DP)
- poj 2342Anniversary party(树形dp)
- poj 2342 Anniversary party(树形dp)
- POJ 2342Anniversary party(树形DP)
- POJ 2342 Anniversary party (树形dp)
- poj 2342 Anniversary party(树形dp)
- POJ 2342 - Anniversary party (树形dp)
- poj 2342 Anniversary party (树形DP)
- POJ 2342 Anniversary party(树形DP)
- POJ-2342-Anniversary party(树形DP)
- POJ 2342 Anniversary party (树形dp)
- POJ 2342 Anniversary party(树形DP)
- 软件企业以人为本的一些措施
- 不限文章大小!英文文章的编码和解码(C语言,哈夫曼编码)
- [LeetCode OJ][008]String to Integer (atoi)
- MyEclipse10破解 运行run.bat闪退
- windows 下memcache的安装
- hdu1520Anniversary party(比poj 2342数据强一些)
- 理解JavaScript原型
- swift UI专项训练5 定制视图控制器
- spring mvc处理提交的时间类型的参数
- OC面向对象—继承
- 用法总结:NSArray,NSSet,NSDictionary
- 提取url的参数的js方法
- android file
- 软件项目用人的一些策略