poj 2342 Anniversary party

最新推荐文章于 2024-11-12 21:59:57 发布

疯狂的橡树

最新推荐文章于 2024-11-12 21:59:57 发布

阅读量827

点赞数

分类专栏：动态规划文章标签：算法 C ACM

本文链接：https://blog.csdn.net/bossup/article/details/9283989

版权

动态规划专栏收录该内容

107 篇文章 1 订阅

订阅专栏

Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3284		Accepted: 1819

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 N – 1 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

Sample Output

Source

Ural State University Internal Contest October'2000 Students Session

动态转移方程

对于本题：用f[i][0] 表示不选i 时，以i 为根子树的最大权值；用f[i][1] 表示选择i 时，以i 为根子树的最大值。

f[i][0]=sum(max(f[j][0],f[j][1]))

f[ i ][1]=sum(f[j][0])

#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

struct node
{
    int fa;//记录父结点。方便找根
    int value;//记录快乐值
    int next;//记录下一条边的标号
} edge[6010];
int head[6010],vis[6010],dp[6010][2];//dp[i][]1,0代表第i个人要和不要产生的最大快乐值
int n,k,l;
int ma(int a,int b)
{
    return a>b?a:b;
}
void adde(int son,int f)//加边
{
    edge[son].fa=f;
    edge[son].next=head[f];
    head[f]=son;
}
void dfs(int r)//树形dp
{
    int p;
    if(vis[r])//记忆化搜索
    return;
    vis[r]=1;
    if(head[r]==-1)//如果到了叶子结点
    {
        dp[r][1]=edge[r].value;
        dp[r][0]=0;
        return;
    }
    p=head[r];
    while(edge[p].next!=-1)//遍历各儿子结点
        {
            dfs(p);
            dp[r][0]+=ma(dp[p][0],dp[p][1]);//动态转移方程
            dp[r][1]+=dp[p][0];
            p=edge[p].next;
        }
    dfs(p);//计算最后一个儿子
    dp[r][0]+=ma(dp[p][0],dp[p][1]);
    dp[r][1]+=dp[p][0]+edge[r].value;
    //printf("%d>>>>>>%d %d\n",r,dp[r][0],dp[r][1]);
}
int main()
{
    int i,root;

    while(~scanf("%d",&n))
    {
        memset(head,-1,sizeof head);
        memset(dp,0,sizeof dp);
        memset(vis,0,sizeof vis);
        memset(edge,-1,sizeof edge);
        for(i=1;i<=n;i++)
            scanf("%d",&edge[i].value);
        while(scanf("%d%d",&l,&k),l||k)
         adde(l,k);
         root=1;//找根结点
         while(edge[root].fa!=-1)
            root=edge[root].fa;
         dfs(root);
         printf("%d\n",ma(dp[root][0],dp[root][1]));
    }
    return 0;
}