[树形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

poj2342 Anniversary party(树形dp)

Anniversary party Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5516 Accepted...
  • d_x_d
  • d_x_d
  • 2015年11月04日 21:24
  • 1243

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

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4410 ...
  • sr19930829
  • sr19930829
  • 2014年10月28日 11:27
  • 1718

Anniversary party(树形dp第一步)

Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State U...
  • bmamb
  • bmamb
  • 2016年05月06日 17:09
  • 654

HDU1520:Anniversary party(树形DP)

Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural Stat...
  • libin56842
  • libin56842
  • 2013年08月10日 15:57
  • 2834

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
  • 1521

HDU 1520 Anniversary party(简单树形dp)

本文出自   http://blog.csdn.net/shuangde800 题目点击打开链接 题意: 给出一棵树 每个节点有权值 要求父节点和子节点不能同时取 求能够取得的最大值 ...
  • shuangde800
  • shuangde800
  • 2013年08月03日 13:35
  • 1246

POJ2342:Anniversary party(树形DP)

Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State Unive...
  • libin56842
  • libin56842
  • 2013年08月07日 11:21
  • 4723

HDU1520(树形dp入门题)

题意:在一个有根树上每个节点有一个权值,每相邻的父亲和孩子只能选择一个,问怎么选择总权值之和最大。思路: 树形dp的常规入门题:设dp[i][0]表示:当前这个点不选,dp[i][1]表示当前这个点...
  • yexiaohhjk
  • yexiaohhjk
  • 2016年09月28日 21:40
  • 807

poj 2342 Anniversary party(简单树形dp+dfs)

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3332 ...
  • u011262722
  • u011262722
  • 2013年07月25日 19:44
  • 1099

【poj2342】 Anniversary party

http://poj.org/problem?id=2342 (题目链接)题意:没有上司的舞会。。。Solution   树形dp入门题。   dp[i][1]表示第i个节点的子树当节点i去时的最...
  • MashiroSky
  • MashiroSky
  • 2016年08月12日 16:26
  • 193
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[树形dp][入门]hdu1520 & poj2342 Anniversary party
举报原因:
原因补充:

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