poj 2342 Anniversary party

传送门

Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12912		Accepted: 7370

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

 

经典树形dp

超容易，超基础

基本上跟搜索剪枝很像，基本一样，

 

#include<stdio.h>
#include<string.h>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define ll long long
const int maxn=6005;
//int a[maxn][maxn];
int val[maxn];
int dp[maxn][2];
vector<int>a[maxn];
int dfs(int up,int flag,int n){///flag==0代表选，flag=1代表不选
     if(dp[up][flag]!=-1){
        return dp[up][flag];
    }
    int sum=0;
    if(flag==1){
        for(int i=0;i<a[up].size();i++){
            sum=sum+dfs(a[up][i],0,n);
        }///下属都不来的最优组合
        dp[up][flag]=sum+val[up];
    }else {
        for(int i=0;i<a[up].size();i++){
            if(a[up][i])
            sum=sum+max(dfs(a[up][i],0,n),dfs(a[up][i],1,n));///下属来或者不来的最优组合
        }
        dp[up][flag]=sum;
    }
    return dp[up][flag];
}
int main(){
    int n;
    while(scanf("%d",&n)==1){
         for(int i=1;i<=n;i++){
            scanf("%d",&val[i]);
        }
         memset(dp,-1,sizeof(dp));
        int f[maxn+3];///标记老大
        memset(f,0,sizeof(f));
         int l,k;
        while(scanf("%d%d",&l,&k),l||k){
            a[k].push_back(l);
              f[l]=1;
        }
        int first=0;///选出老大
        for(int i=1;i<=n;i++){
            if(!f[i]){
                first=i;
                break;
            }
        }
        int x=0;
        x=max(dfs(first,1,n),dfs(first,0,n));
        printf("%d\n",x);
    }
    return 0;


}