J - Anniversary party POJ - 2342（树形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.
Sample Input
7
1
1
1
1
1
1
1
1 3
2 3
6 4
7 4
4 5
3 5
0 0
Sample Output
5

题目大意：

某公司的员工参加一次聚会，给你N代表参加的人数，接下有N个数，第i个数代表第i个员工的快乐指数，

接下来输入L,K，代表K是L的直接上司，遇到0 0结束。现在每个员工都不希望和自己的直接上司一起参加，问参加这个聚会的最大快乐指数可以为多少？

树形dp题，用father数组表示父亲是谁，root表示根节点。
用dp[ ] [0] 和dp[][1] 分别表示来和没有来

            dp[node][1]+=dp[i][0];//如果上司来了，那么下属就没来
            dp[node][0]+=max(dp[i][1],dp[i][0]);//如果上司没来，那么就有下属来和下属没来两种 

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<iostream>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
const int N=6010;
const int prime=2333317;
const int INF=0x3f3f3f3f3f;
int n;
int dp[N][2],father[N],vis[N];
void dfs(int node)
{
    vis[node]=1;
    for(int i=1;i<=n;i++)
    {
        if(vis[i]!=1&&father[i]==node)
        {
            dfs(i);
            dp[node][1]+=dp[i][0];//如果上司来了，那么下属就没来
            dp[node][0]+=max(dp[i][1],dp[i][0]);//如果上司没来，那么就有下属来和下属没来两种 
        }
    }
}
void init()
{
    memset(dp,0,sizeof(dp));
    memset(vis,0,sizeof(vis));
    memset(father,0,sizeof(father));
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        init();
        int root,staff,boss;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&dp[i][1]);
        }
        while(scanf("%d%d",&staff,&boss)!=EOF&&staff+boss)
        {
            father[staff]=boss;
            root=boss;
        }
        for(int i=1;i<=n;i++)
        {
            if(father[i]!=0)
                continue;
            root=father[i];
        }
        dfs(root);
        printf("%d\n",max(dp[root][1],dp[root][0]));
    }
    return 0;
}