zoukankan      html  css  js  c++  java
  • hdu 1520 Anniversary party || codevs 1380 树形dp

    Anniversary party

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

    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<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define mod 1000000007
    #define esp 0.00000000001
    const int N=2e5+10,M=1e6+10,inf=1e9;
    int a[N];
    int du[N];
    vector<int>v[N];
    int dp[N][3];
    void dfs(int x,int step)
    {
        for(int i=0;i<v[x].size();i++)
        {
            dfs(v[x][i],step+1);
            dp[x][0]+=max(dp[v[x][i]][0],dp[v[x][i]][1]);
            dp[x][1]+=dp[v[x][i]][0];
        }
    }
    int main()
    {
        int x,y,z,i,t;
        while(~scanf("%d",&x))
        {
            memset(dp,0,sizeof(dp));
            memset(du,0,sizeof(du));
            for(i=0;i<=x;i++)
            v[i].clear();
            for(i=1;i<=x;i++)
            scanf("%d",&a[i]),dp[i][1]=a[i];
            while(1)
            {
                scanf("%d%d",&y,&z);
                if(y==0&&z==0)
                break;
                du[y]++;
                v[z].push_back(y);
            }
            for(i=1;i<=x;i++)
            if(du[i]==0)
            {
                dfs(i,1);
                break;
            }
            printf("%d
    ",max(dp[i][1],dp[i][0]));
        }
        return 0;
    }
  • 相关阅读:
    JavaScript—飞机大战
    JavaScript—瀑布流
    JavaScript—原生轮播和无缝滚动
    JavaScript—封装animte动画函数
    JavaScript—offset、client、scroll
    JavaScript—对象创建方式
    JavaScript—var lef const区别
    P1352 没有上司的舞会 题解
    P1829 [国家集训队]Crash的数字表格 / JZPTAB 题解
    P2522 [HAOI2011]Problem b 题解
  • 原文地址:https://www.cnblogs.com/jhz033/p/5671540.html
Copyright © 2011-2022 走看看