POJ2342 树型动态规划

题意：

— 有个公司要举行一场晚会。为了让到会的每个人不受他的直接上司约束而能玩得开心，公司领导决定：如果邀请了某个人，那么一定不会再邀请他的直接的上司，但该人的上司的上司，上司的上司的上司……都可以邀请。已知每个人最多有唯一的一个上司。

—已知公司的每个人参加晚会都能为晚会增添一些气氛，求一个邀请方案，使气氛值的和最大。

思路：建上司与下属的树图。

每个结点分取与不取的状态，则有dp[node][0]表示不取，dp[node][1]为取

 

则dp[faher][1]=sum(dp[child][0])+value[fahter];

dp[father][0]=sum(max(dp[child][0],dp[child][1]));

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using  namespace std;
const int MAXN=6000;
int power[MAXN+10];
//int f[MAXN*(MAXN-1)/2+10];
int f[MAXN+10];
  int n;
bool visit[MAXN];
int result[MAXN][2];
void tree_dp(int node)
{
  int i;
  for(i=1;i<=n;i++)
    {
      if(visit[i]==false&&f[i]==node)
    {
      tree_dp(i);
      result[node][1]+=result[i][0]+power[i];
      result[node][0]+=max(result[i][0],result[i][1]);
     

         

     
    }
     

    }
  return;
}
int main()
{

  int child,father;
  int root;
  int i;
  //while(scanf("%d",&n)!=EOF)
  scanf("%d",&n);
    {
      memset(visit,0,sizeof(visit));
      memset(result,0,sizeof(result));
      root=0;
      for(i=1;i<=n;i++)
    {
      scanf("%d",&power[i]);
    }
      memset(f,0,sizeof(f));
      while(scanf("%d %d",&child,&father)&&child&&father)
    {
      f[child]=father;
      if(child==root)
    {
      root=father;
    }
     
    }
 
   
   
    }
    tree_dp(root);
  printf("%d/n",max(result[root][0],result[root][1]));
         
     
   
    return 0;
}

附题目：

Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 1978		Accepted: 1072

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