题解报告：hdu 1520 Anniversary party（树形dp入门）

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

711111111 32 36 47 44 53 50 0

Sample Output

5解题思路：这道题跟树的最大独立集的思想很类似，只不过每个节点被赋予了一个权值，即有一群人参加聚会，要求上司和直系下属不能同时到场，求到场的人欢乐程度之和的最大值。dp[i][0]表示i没来参加，dp[i][1]表示i有来参加，状态转移方程：j是i的直系下属，①当i来参加时累加i的直系下属j没来参加的欢乐值，dp[i][1]+=dp[j][0]；②当i没来参加时，dp[i][0]+=max(dp[j][1],dp[j][0]);累加去或不去这两者中的最大欢乐值。AC代码(78ms)：

 #include<iostream>
 #include<vector>
 #include<algorithm>
 #include<string.h>
 #include<cstdio>
 using namespace std;
 const int maxn=;
 int n,l,k,rt,dp[maxn][],InDeg[maxn];bool vis[maxn];vector<int>vec[maxn];
 void dfs(int root){
     for(size_t i=;i<vec[root].size();++i){
         int v=vec[root][i];
         dfs(v);//这里只会对整棵树中每个节点遍历一次，并不会重复访问，所以可以不使用vis数组
         dp[root][]+=dp[v][];//root去，则v不去（1表示去，0表示不去），累加不去的最大值
         dp[root][]+=max(dp[v][],dp[v][]);//root不去，取v去或不去的最大值
     }
 }
 int main(){
     while(~scanf("%d",&n)){
         memset(dp,,sizeof(dp));
         memset(InDeg,,sizeof(InDeg));
         for(int i=;i<=n;++i)vec[i].clear();
         for(int i=;i<=n;++i)scanf("%d",&dp[i][]);//刚开始都要去的都有这个权值
         while(~scanf("%d%d",&l,&k)&&(l+k)){
             vec[k].push_back(l);
             ++InDeg[l];//将l的入度加1
         }
         for(int i=;i<=n;++i)
             if(!InDeg[i]){rt=i;break;}//找到树的根节点，其入度为0
         dfs(rt);
         printf("%d\n",max(dp[rt][],dp[rt][]));
     }
     return ;
 }