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

原创 2016年05月31日 16:27:56

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;
}
版权声明:本文为博主原创文章,转载请注明: blog.csdn.net/gdymind

相关文章推荐

HDU 1520 & POJ 2342 Anniversary party(树形DP入门题)

HDU 1520 & POJ 2342 Anniversary party(树形DP入门题)

HDU 1520 & POJ 2342 Anniversary party(树形dp)

Anniversary party Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...

poj 2342 / hdu 1520 Anniversary party(树形dp)

每一个第一次写的算法总是会给我留下深刻的印象。。。

hdu1520 Anniversary party(poj2342,树形dp)

Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
  • d_x_d
  • d_x_d
  • 2015年11月07日 15:28
  • 1403

hdu 1520 && poj2342 anniversary party树形DP

每个节点要么选要么不选,和大多数选不选动归一样,来个dp[i][2],0表示不选,1表示不选,那我们只要从叶子节点往根结点不断更新dp[i][0]和dp[i][1]就可以了。     状态转移方程:...

poj 2342 Anniversary party (树形dp入门)

题意: 某公司要举办一次晚会,但是为了使得晚会的气氛更加活跃,每个参加晚会的人都不希望在晚会中见到他的直接上司,现在已知每个人的活跃指数和上司关系(当然不可能存在环),求邀请哪些人(多少人)来能使得晚...

poj 2342 anniversary party(树形dp入门)

题目链接:点击打开链接 题目大意:给一些关系,都是上下级的关系,但是同时出现在party上就会不开心,每个人都有一个开心值,于是主板要使得party的开心值最大,则 题目分析:很裸的树形dp。...

poj-2342 Anniversary party(树形DP入门)

题目链接:http://poj.org/problem?id=2342                                                                ...
  • acm_cxq
  • acm_cxq
  • 2016年04月19日 13:15
  • 175

[ACM] POJ 2342 Anniversary party (树形DP入门题)

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4410 ...

POJ2342 ->Anniversary party(树形DP入门题)

描述: Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5516 A...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[树形dp][入门]hdu1520 & poj2342 Anniversary party
举报原因:
原因补充:

(最多只允许输入30个字)