HDU 1520 Anniversary party tree DP entry

HDU 1520 Anniversary party tree DP entry

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 DescriptionThere 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.

InputEmployees 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
OutputOutput shoshould contain the maximal sum of guests ratings.

Sample Input

711111111 32 36 47 44 53 50 0

Sample Output

5

Question: The company party and the active values of n people are given, and then the employee and direct supervisor are not allowed to participate at the same time.

# Include
 
  
# Include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      
        # Define N 6009 using namespace std; int n; vector
       
         V [N]; int dp [N] [2]; // Boolean array 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