HDU_1520_树形DP(递推形式_不能标记)

最新推荐文章于 2020-07-21 21:21:14 发布

Jianbagengmu

最新推荐文章于 2020-07-21 21:21:14 发布

阅读量227

点赞数

分类专栏：树形dp 文章标签：结构 dp

本文链接：https://blog.csdn.net/jianbagengmu/article/details/79169442

版权

树形dp 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Anniversary party

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

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
Ural State University Internal Contest October’2000 Students Session

Recommend
linle
Mean:
第一行输入一个n代表有n个人从1开始;
接下来n行每行输入一个数字代表第i行人的等级(从一开始);
接下来输入两个整数u,v, v是u员工的上级;
当u=v=0时输入结束;
题目要求员工和上级不能同时出现,问你这种情况下,最大的等级和
ans
树形 dp ,只有两种转移状态
dp[root][0]代表上级没来就是 +=max(dp[soon][0],dp[soon][1]),下级来或者不来的最大值
dp[root][1]+=dp[soon][0];同理

#include<bits/stdc++.h>
using namespace std;
int n,m;
const int N=6666;
vector<int> tree[N];
int val[N],vis[N],father[N],dp[N][2];
void dfs(int root)
{
    //vis[root]=1;
    int i,soon;
    for(i=0;i<tree[root].size();i++)
    {
        soon=tree[root][i];
        dfs(soon);
     //   if(vis[soon]) continue;
        dp[root][0]+=max(dp[soon][1],dp[soon][0]);
        dp[root][1]+=dp[soon][0];
    }
}
int main()
{
     int i,j;
    while(cin>>n)
    {
        for(i=1;i<=n;i++)
        {
            scanf("%d",&dp[i][1]);
            dp[i][0]=vis[i]=father[i]=0;
            tree[i].clear();
        }
        int u,v,root=1;
        while(scanf("%d%d",&u,&v),u+v)
        {
         tree[v].push_back(u);
         father[u]=v;
         root=v;
        }
        while(father[root])
            root=father[root];
        dfs(root);
        int ans=max(dp[root][0],dp[root][1]);
        printf("%d\n",ans);
    }
}