hdu1520 Anniversary party(poj2342,树形dp)

Anniversary party

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 7303 Accepted Submission(s): 3220

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

这题和poj2342是一样的,但是hdu的数据加强了,用poj2342AC的代码可能会超时,poj2342解析报告

这里用的方法有点不一样,但大概也都是一样的,只是加入了一些父子兄弟关系,也不是很难理解。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
#define ll long long
#define CL(a,b) memset(a,b,sizeof(a))

struct Tree
{
    int father;//父亲
    int child;//儿子
    int brother;//兄弟
    int Not;//不去party
    int TakeParty;//去party
    int MAX() {return TakeParty > Not ? TakeParty : Not;}//结构体调用函数省时间
    int init()//树清空
    {
        father = child = brother = Not = 0;
    }
}tree[6005];

void dfs(int idx)
{
    int child = tree[idx].child;
    while(child)//如果有孩子继续查
    {
        dfs(child);
        tree[idx].TakeParty += tree[child].Not;//如果idx去party,那么它的孩子就不能去
        tree[idx].Not += tree[child].MAX();//如果idx不去party,那么它的孩子可去可不去
        child = tree[child].brother;//查找其他孩子
    }
}

int main()
{
    int n,a,b;
    while(scanf("%d",&n)==1)
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&tree[i].TakeParty);
            tree[i].init();
        }
        while(scanf("%d%d",&a,&b),a+b)//建树
        {
            tree[a].father = b;
            tree[a].brother = tree[b].child;
            tree[b].child = a;
        }
        for(int i=1; i<=n; i++)//查找
        {
            if(!tree[i].father)
            {
                dfs(i);
                printf("%d\n",tree[i].MAX());
                break;
            }
        }
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

时间: 2024-10-28 16:12:40

hdu1520 Anniversary party(poj2342,树形dp)的相关文章

HDU1520 Anniversary party(树形dp入门题)

题意: 给定一棵关系树,每个节点有个权值,子节点和父节点不能同时选,问最后能选的最大价值是多少? 思路: dp[i][1]表示选,dp[i][0]表示不选 则状态转移方程为: dp[i][1]+=dp[j][0]; dp[i][0]+=max(dp[j][1],dp[j][0]); AC代码: #include <iostream> #include <cstdio> #include <cstring> #include <string> #include

poj2342 Anniversary party (树形dp)

poj2342 Anniversary party (树形dp) Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9128   Accepted: 5250 Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarc

poj 2342 Anniversary party,树形DP easy

poj 2342 Anniversary party 没有上司的晚会 Ural大学有N个职员,编号为1~N.他们有从属关系,也就是说他们的关系就像一棵以校长为根的树,父结点就是子结点的直接上司.每个职员有一个快乐指数.现在有个周年庆宴会,要求与会职员的快乐指数最大.但是,没有职员愿和直接上司一起与会. 程序名:party 输入格式: 第一行一个整数N.(1<=N<=6000) 接下来N行,第i+1行表示i号职员的快乐指数Ri.(-128<=Ri<=127) 接下来N-1行,每行输入

poj2342 Anniversary party 简单树形dp

http://poj.org/problem?id=2342 Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4322   Accepted: 2459 Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The Universi

Hdoj 1520&amp;Poj2342 Anniversary party 【树形DP】

Anniversary party Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5917 Accepted Submission(s): 2692 Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural

poj2342 Anniversary party【树形dp】

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4567   Accepted: 2594 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

HDOJ 题目1520 Anniversary party(树形dp)

Anniversary party Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6271    Accepted Submission(s): 2820 Problem Description There is going to be a party to celebrate the 80-th Anniversary of the

poj2342 树形dp

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 5844   Accepted: 3354 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

POJ 2342 Anniversary party(树形dp)

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7230   Accepted: 4162 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

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

Anniversary party Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4410   Accepted: 2496 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