zoukankan      html  css  js  c++  java
  • hdu 1520 Anniversary party 树形dp水题

    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

    公司举行晚会,要求不能有两个是直属上下级的员工同时出现,求最大开心度。

    水题,不解释。

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<vector>
    #include<stack>
    using namespace std;
    const int MAXM = 6005;
    const int MAXN = 6005;
    
    struct Edge
    {
        int to,next;
    } edge[MAXM];
    int head[MAXN],tot;
    void addedge(int u,int v)
    {
        edge[tot].to = v;
        edge[tot].next = head[u];
        head[u] = tot++;
    }
    void init()
    {
        tot = 0;
        memset(head,-1,sizeof(head));
    }
    
    
    int n,m;
    int dp[MAXN][2];
    int p[MAXN]={0};
    int dfs(int u,int go) {
        if(dp[u][go]!=-1) return dp[u][go];
        if(go) dp[u][go] = p[u];
        else dp[u][go] = 0;
        for(int e=head[u];e!=-1;e=edge[e].next) {
            int v = edge[e].to;
            if(go) dp[u][go] += dfs(v,0);
            else dp[u][go] += max(dfs(v,0),dfs(v,1));
        }
        //printf("%d %d %d
    ",u,go,dp[u][go]);
        return dp[u][go];
    }
    
    int main()
    {
        int u,v;
        while(scanf("%d",&n)!=EOF)
        {
            init();
            memset(dp,-1,sizeof(dp));
            for(int i=1;i<=n;i++) scanf("%d",&p[i]);
    
            bool vis[MAXN];
            memset(vis,0,sizeof(vis));
            while(1)
            {
                scanf("%d%d",&u,&v);
                if(u==0) break;
                addedge(v,u);
                vis[u] = 1;
            }
            for(int i=1;i<=n;i++) {
                if(!vis[i]) addedge(0,i);
            }
            printf("%d
    ",dfs(0,0));
        }
        return 0;
    }
  • 相关阅读:
    我的友情链接
    我的友情链接
    Plasma Debit原理分析
    Plasma技术详解
    Plasma MVP完全解析
    简单介绍 Plasma
    MySQL从零到一解读增量同步数据到elasticsearch canal adapter方式(binlog)实现
    Oracle数据库备份和恢复配置详解
    python open()函数解析(最清晰的解释)
    这几道Python面试题,稳准狠,Python面试题No15
  • 原文地址:https://www.cnblogs.com/lastone/p/5360774.html
Copyright © 2011-2022 走看看