poj 2342 树形dp入门

Anniversary party

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8203 Accepted: 4698

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

711111111 32 36 47 44 53 50 0

Sample Output

5

简单树形dp

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int n;#define MAXN 6010int father[MAXN],visit[MAXN],dp[MAXN][2];void dfs(int pos){    visit[pos]=1;    for(int i=1;i<=n;i++){        if(!visit[i]&&father[i]==pos){            dfs(i);            dp[pos][1]+=dp[i][0];            dp[pos][0]+=max(dp[i][0],dp[i][1]);        }    }}int main(){    //freopen("in.txt","r",stdin);    while(scanf("%d",&n)!=EOF)    {        for(int i=1;i<=n;i++)            scanf("%d",&dp[i][1]);        int L,K,root=1;        memset(visit,0,sizeof(visit));        memset(father,0,sizeof(father));        while(scanf("%d%d",&L,&K),L+K>0)            father[L]=K;        while(father[root])            root=father[root];        dfs(root);        printf("%d\n",max(dp[root][0],dp[root][1]));    }    return 0;}