POJ 2342 Anniversary party （树形dp）

题目描述： 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.

解题思路：题目中所给的从属关系可以构成一棵以校长为根的树，对每一个节点来说有两种情况，最优解包含节点本身的权值，最优解不包含其本身的权值。根据这个特点可以构造出两种dp状态dp[i][0]和dp[i][1]。

      dp[i][0]不包括第i个节点快乐指数的情况下，以i为根的子树可以得到的最大快乐指数和。

       dp[i][1]    包括第i个节点快乐指数的情况下，以i为根的子树可以得到的最大快乐指数和。

再确定状态转移方程：

       dp[i][0] =  ∑ max( dp[v][0], dp[v][1])   v : v为节点i的所有子节点

       dp[i][1] =  ∑ dp[v][0]

AC代码：

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>

#define Fori(x) for(int i=0;i<x;i++)
#define Forj(x) for(int j=0;j<x;j++)
#define maxn 6005
#define inf 0x3f3f3f3f
#define ONES(x) __builtin_popcount(x)
using namespace std;

typedef long long ll ;
const double eps =1e-8;
const int mod = 1000000007;
typedef pair<int, int> P;
const double PI = acos(-1.0);
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};

int n,q;
int ans;
int a[maxn];
bool root[maxn];
int dp[maxn][2];
vector<int> e[maxn];

int dfs(int u, int flag)// build a tree
{
	if(dp[u][flag])	return dp[u][flag];
	if(flag)	dp[u][flag] = a[u];
	for(int i = 0; i<e[u].size(); i++)
	{
		int v = e[u][i];
		dfs(v,0);
		dfs(v,1);
		if(flag)
			dp[u][flag] += dp[v][0];
		else
			dp[u][flag] += max(dp[v][0], dp[v][1]);
	}
	return dp[u][flag];
}

int main()
{
    //freopen("test.txt","r",stdin);
    int n;
    cin>>n;
    for(int i = 1; i<=n; i++)
    	cin>>a[i];
    for(int i = 1; i<=n; i++)
    {
    	int u,v;
    	cin>>v>>u;
    	e[u].push_back(v);
    	root[v] = 1;
    }
    for(int i = 1; i<=n; i++)
    {
    	if(root[i]==0){
    		dfs(i,0);
    		dfs(i,1);
    		cout << max(dp[i][0],dp[i][1]) << endl;
    		break;
    	}
    }
    return 0;
}