HDU——1520Anniversary party

最新推荐文章于 2019-11-16 00:02:34 发布

tokers

最新推荐文章于 2019-11-16 00:02:34 发布

阅读量411

点赞数

分类专栏： hdu

本文链接：https://blog.csdn.net/Guard_Mine/article/details/38381505

版权

hdu 专栏收录该内容

242 篇文章 0 订阅

订阅专栏

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

Sample Output

Source

Ural State University Internal Contest October'2000 Students Session

树形dp入门题，我们用数组dp[rt][1]表示当前节点选入， dp[rt][0]表示当前节点不选入，最后答案就是max(dp[rt][1],dp[rt][0])，

那么如果当前节点选入的话，他的下一个节点就不能选，如果当前节点不选入，那么他的下一个节点可选可不选。

所以状态转移方程就是

dp[rt][1]+=dp[子节点][0];

dp[rt][0]+=max(dp[子节点][0],dp[子节点][1])

另外树形dp一定要深搜到树的最底层再返回来求个各个节点的属性。

#include<stdio.h>
#include<vector>
#include<string.h>
const int maxn=6010;
using namespace std;

vector<int>tree[maxn];
int dp[maxn][2];
int value[maxn];
int root[maxn];
int max(int a,int b)
{
	return a>b?a:b;
}
void dfs(int rt)
{
	int size=tree[rt].size();
	dp[rt][1]=value[rt];
	for(int i=0;i<size;i++)
		dfs(tree[rt][i]);//树形dp，深搜到底层，
	for(int i=0;i<size;i++)
	{
		dp[rt][1]+=dp[tree[rt][i]][0];
		dp[rt][0]+=max(dp[tree[rt][i]][1],dp[tree[rt][i]][0]);
	}
}


int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		int x,y;
		int rt;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&value[i]);
			root[i]=-1;
			tree[i].clear();
		}
		memset(dp,0,sizeof(dp));
		while(1)
		{                                                                                                                          
			scanf("%d%d",&x,&y);
			if(x==0 && y==0)
			  break;
	        tree[y].push_back(x);
	        root[x]=y;
	        if(root[y]==-1)
	          rt=y;
		}
		dfs(rt);
		printf("%d\n",max(dp[rt][0],dp[rt][1]));	
	}
	return 0;
}