POJ2342 Anniversary party【树形DP】-CSDN博客

Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 11540		Accepted: 6642

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 N – 1 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

Sample Output

Source

Ural State University Internal Contest October'2000 Students Session

问题链接：POJ2342 Anniversary party

问题描述：公司要举办一次晚会，但是为了使得晚会的气氛更加活跃，每个参加晚会的人都不希望在晚会中见到他的直接上司，现在已知每个人的活跃指数和上司关系（当然不可能存在环），求邀请哪些人（多少人）来能使得晚会的总活跃指数最大。

解题思路：树形DP，已每个员工之间的关系建立一颗关系树；任何一个点的取舍可以看做一种决策，对于每个点以它为根的子树活跃度最大。https://blog.csdn.net/d_x_d/article/details/49643547

AC的C++程序：

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N=6005;
int n,dp[N][2],father[N];//dp[i][0]表示i不去，dp[i][1]表示i去
bool vis[N];

void tree_dp(int node)
{
	vis[node]=true;
	for(int i=1;i<=n;i++)
	{
		if(!vis[i]&&father[i]==node)
		{
			tree_dp(i);
			dp[node][1]+=dp[i][0];//上司来 
			dp[node][0]+=max(dp[i][0],dp[i][1]);//上司来，下属选择来或者不来 
		}
	}
}

int main()
{
	int f,c,root;
	while(~scanf("%d",&n))
	{
		memset(dp,0,sizeof(dp));
		memset(father,0,sizeof(father));
		memset(vis,false,sizeof(vis));
		for(int i=1;i<=n;i++)
		  scanf("%d",&dp[i][1]);
		root=0;//记录父亲结点
		while(~scanf("%d%d",&c,&f)&&(c||f))
		{
			father[c]=f;
			root=f;
		}
		while(father[root]) 
		  root=father[root];
		tree_dp(root);
		printf("%d\n",max(dp[root][0],dp[root][1]));
	}
	return 0;
 }