关闭

[树形dp][入门]hdu1520 & poj2342 Anniversary party

标签: dpACMhdupoj树形dp
94人阅读 评论(0) 收藏 举报
分类:

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

题目分析

    树形dp入门题

  • dp[x][0]表示以x为根节点的子树,x不被选,所得最大值
  • dp[x][1]表示以x为根节点的子树,x被选,所得最大值

    注意读入,题目中位A first line而不是The first line,也就是有多组输入数据,英语渣表示被坑了。。。

代码

#include <iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

int max(int a,int b)
{
    return (a>b)?a:b;
}

const int maxn=6e3+5;
vector<int> son[maxn];
bool f[maxn]={0};
int dp[maxn][2]={0};

void dfs(int x)
{
    if(son[x].size()==0) return;
    for(int i=0;i<son[x].size();i++) dfs(son[x][i]);
    for(int i=0;i<son[x].size();i++)
    {
        dp[x][1]+=dp[son[x][i]][0];
        dp[x][0]+=max(dp[son[x][i]][0],dp[son[x][i]][1]);
    }
}

int main()
{
    int n;
    while(cin>>n)
    {
        memset(f,0,sizeof f);
        memset(dp,0,sizeof dp);
        for(int i=1;i<=n;i++) scanf("%d",&dp[i][1]);
        for(int i=1;i<=n;i++) son[i].clear();
        int x,y;
        while(~scanf("%d%d",&x,&y) && x && y)
        {
            f[x]=true;
            son[y].push_back(x);
        }
        int rt;
        for(rt=1;rt<=n;rt++) if(!f[rt]) break;
        dfs(rt);
        cout<<max(dp[rt][0],dp[rt][1])<<endl;

    }

    return 0;
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7371次
    • 积分:730
    • 等级:
    • 排名:千里之外
    • 原创:67篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条