POJ 2342 Anniversary party （树形dp）

Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5874		Accepted: 3378

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

Source

题目链接：http://poj.org/problem?id=2342

题目大意：给n个员工的参加聚会的快乐值，再给出n个员工之间的从属关系（构成树形关系，也就是一个员工只对应一个上属，可对应多个下属，注意：并不是所有员工之间都有从属关系），员工们要参加一个聚会，要求具有直接从属关系的两名员工不能同时参加，求员工最大的快乐总值。

解题思路：树形dp，第一次写树形dp，很顺利，1A，可能题目比较简单吧～vector存储员工之间的关系，标记每个没“下属”身份的员工，他们作为不同树的根结点，从dfs入手找叶子结点，在找到叶子结点后返回过程dp。

分两种情况，dp[ x ][ 0 ]  和 dp[ x ][ 1 ] ：dp[ x ][ 0 ]表示不选择当前点，状态转移方程为dp[ x ][ 0 ] + = max ( dp[ y ][ 0 ],dp[ y ][ 1 ] );  
(当前点不选的话，前一点可以选也可以不选)

                                                                dp[ x ][ 1 ]表示选择当前点，状态转移方程为dp[ x ][ 1 ] = ( dp[ y ][ 0 ]+dp[ y ][ 0 ]+...+dp[ y ][ 0 ] ) + a [ x ];(当前点选择的话，所有前一点就必须不能选)

为什么要倒过来呢，因为前一层的点和当前点必须是多对一的关系，状态才能转移。

代码如下：