zoukankan      html  css  js  c++  java
  • 树形DP基础题 HDU1520

    Anniversary party

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 11060    Accepted Submission(s): 4582


    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

    //题解就不写了 看代码就应该懂了

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    #include<vector>
    using namespace std;
    const int maxn=6005;
    vector<int>vec[maxn];
    int value[maxn],vis[maxn],f[maxn][2],in[maxn];
    void dfs(int u){
       f[u][0]=0;
       f[u][1]=value[u];
       vis[u]=1;
       for(int i=0;i<(int)vec[u].size();++i){
        int v=vec[u][i];
        if(vis[v]) continue;
        dfs(v);
        f[u][0]+=max(f[v][0],f[v][1]);
        f[u][1]+=f[v][0];
       }
       return ;
    }
    int main(){
        int n,u,v,k;
        while(~scanf("%d",&n)){
            for(int i=0;i<=n;++i) vec[i].clear();
            for(int i=1;i<=n;++i) scanf("%d",&value[i]);
            memset(in,0,sizeof(in));
            while(scanf("%d%d",&v,&u),u||v){
                vec[u].push_back(v);
                ++in[v];
            }
            for(int i=1;i<=n;++i){
                if(!in[i]) {
                    memset(vis,0,sizeof(vis));
                    memset(f,0,sizeof(f));
                    dfs(i);
                    printf("%d
    ",max(f[i][0],f[i][1]));
                    break;
                }
            }
        }
    }
  • 相关阅读:
    折腾了好久的输入法显示已禁用
    文件下载上传小工具
    隐藏进程命令行参数,例如输入密码等高危操作
    创建并使用https证书
    编译lua可执行程序
    使用msys2在window下构建和使用Linux的软件
    golang遍历时修改被遍历对象
    使用shell发送邮件,方便快捷
    关于golang的time包总结
    获取Win和Linux系统启动时间,类似uptime功能,用于判断是否修改过系统时间
  • 原文地址:https://www.cnblogs.com/mfys/p/6918300.html
Copyright © 2011-2022 走看看