Anniversary party1520(树形dp)

Anniversary party

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5303    Accepted Submission(s): 2447
点我找原题

题意：举办一个party，候选人当中有很多人之间有上下级关系，求没有直接上下级的最多的人数。

mark：简单的树形dp题，从每个人的状态着手考虑，每个人要么参加，要么不参加，那么状态dp[i][0]代表参加，dp[i][1]代表不参加。

　　　 dp[i][0] += dp[son][1];

　　　 dp[i][1] += max(dp[son][1], dp[son][0]);

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
   
   

 

#include <iostream>
#include <vector>
#include <cstring>
#define N 6005
using namespace std;

int n,val[N],l,k;
int dp[N][2];
bool boss[N];
vector<int>list[N];

int maxx(int a,int b) 
{
	return a>b?a:b;
}

void dfs(int root)
{
	if(list[root].size()==0) return ;
	int i;
	for(i=0;i<list[root].size();i++)
	{
		dfs(list[root][i]);
	}
	for(i=0;i<list[root].size();i++)
	{
		dp[root][1]+=dp[list[root][i]][0];
		dp[root][0]+=maxx(dp[list[root][i]][0],dp[list[root][i]][1]);
	}
}

int main(int argc, char *argv[])
{
	while(scanf("%d",&n)!=EOF)
	{
		int i;
		memset(boss,false,sizeof(boss));
		memset(dp,0,sizeof(dp));
		for(i=0;i<=n;i++) list[i].clear();
		for(i=1;i<=n;i++) 
		{
			scanf("%d",&val[i]);
			dp[i][1]=val[i];
		}
		while(scanf("%d%d",&l,&k)!=EOF)
		{
			if(l==0&&k==0) break;
			list[k].push_back(l);
			boss[l]=true;
		}
		for(i=1;i<=n;i++)
		{
			if(!boss[i]) list[0].push_back(i);
		}
		dfs(0);
		printf("%d\n",maxx(dp[0][0],dp[0][1]));
	}
	return 0;
}