HDU 1520Anniversary party 樹形DP入門

Anniversary party

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5333 Accepted Submission(s): 2459


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

Sample Output

5

題意：公司party，n個人的活躍值給出來，然後告訴職位等級關系，並且職員和直接上司不能同時參加，求最多可以有多少人參加

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define N 6009

using namespace std;

int n;
vectorv[N];
int dp[N][2];//布爾型數組
int fa[N];
int f[N];

void dfs(int node)
{
    int len=v[node].size();
    dp[node][1]=f[node];

    for(int i=0;i