zoukankan      html  css  js  c++  java
  • POJ 2342 Anniversary party

    Anniversary party

    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

    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #define maxn 6005
    using namespace std;
    int n;
    int dp[maxn][2],father[maxn];
    bool visted[maxn];
    void tree_dp(int node)
    {
    	int i;
    	visted[node]=1;
    	for(i=1;i<=n;i++)
    	{
    		if(!visted[i]&&father[i]==node)
    		{
    			tree_dp(i);
    			dp[node][1]+=dp[i][0];
    			dp[node][0]+=max(dp[i][1],dp[i][0]);
    		}
    	}
    }
    int main()
    {
    	int i;
    	int f,c,root;
    	while(scanf("%d",&n)!=EOF)
    	{
    		memset(dp,0,sizeof(dp));
    		memset(father,0,sizeof(father));
    		memset(visted,0,sizeof(visted));
    		for(i=1;i<=n;i++)
    			scanf("%d",&dp[i][1]);
    		root=0;
    		bool beg=1;
    		while(scanf("%d%d",&c,&f),c||f)
    		{
    			father[c]=f;
    			if(root=c||beg)
    				root=f;	
    		}
    		while(father[root])
    			root=father[root];
    		tree_dp(root);
    		int imax=max(dp[root][0],dp[root][1]);
    		printf("%d
    ",imax);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    数据结构实验:连通分量个数
    数据结构实验:连通分量个数
    二叉排序树
    二叉排序树
    数据结构实验之图论七:驴友计划
    数据结构实验之图论七:驴友计划
    AOE网上的关键路径
    AOE网上的关键路径
    图的深度遍历
    图的深度遍历
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057744.html
Copyright © 2011-2022 走看看