zoukankan      html  css  js  c++  java
  • POJ 2342.Anniversary party-树形dp

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 11419   Accepted: 6582

    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

    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

     
     
     
    代码:
     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 using namespace std;
     5 const int N=1e5+10;
     6 int dp[N][3];
     7 int father[N],vis[N];
     8 int n;
     9 void creat(int h){
    10     vis[h]=1;
    11     for(int i=1;i<=n;i++){
    12         if(vis[i]==0&&father[i]==h){
    13             creat(i);
    14             dp[h][0]+=max(dp[i][0],dp[i][1]);
    15             dp[h][1]+=dp[i][0];
    16         }
    17     }
    18 }
    19 int main(){
    20     int i;
    21     while(~scanf("%d",&n)){
    22         memset(dp,0,sizeof(dp));
    23         memset(father,0,sizeof(father));
    24         memset(vis,0,sizeof(vis));
    25         for(int i=1;i<=n;i++)
    26             scanf("%d",&dp[i][1]);
    27         int f,c,root;
    28         root=0;
    29         bool beg=1;
    30         while(scanf("%d %d",&c,&f),c||f){
    31             father[c]=f;
    32             if(root==c||beg)
    33                 root=f;
    34         }
    35             while(father[root])
    36                 root=father[root];
    37                 creat(root);
    38                 int imax=max(dp[root][0],dp[root][1]);
    39                 printf("%d
    ",imax);
    40         }
    41         return 0;
    42 }
  • 相关阅读:
    在oschina上新建项目的步骤
    将txt转为DataTable的方法
    设置IIS让网站拥有“网站目录外文件”的读写权限的操作(图文)
    从客户端****中检测到有潜在危险的 Request.QueryString 值在.net mvc下的解决方法
    动态调用类里的方法的示例(wjx)
    Pyhton忽略返回变量方法
    wsl安装Ubuntu16.04+Python2.7
    win10快速调用Shell代替GitBash
    wsl与win10文件互访
    OpenCV报错file too short解决
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9826281.html
Copyright © 2011-2022 走看看