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
HDU - 1520
主要给你一组数n个 代表其实欢乐度,接下来是输入了 l k其中k是l 的上司,其他们和他们的直接领导不能同时出现,求其最后的最大的欢乐度。
思路主要是其树形dp;
{ 转移方程
dp[i][1]+=dp[j][0]
dp[i][0]+=max(dp[j][0],dp[j][1])
}
#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[6005][2];
int vis[6005];//在这初始值就不行。。。
int f[6005];
int n;
void dfs(int root)
{
vis[root]=1;
for(int i=1;i<=n;i++)
{
if(f[i]==root&&!vis[i])
{
dfs(i);
dp[root][1]+=dp[i][0];
dp[root][0]+=max(dp[i][0],dp[i][1]);
}
}
}
int main()
{
while(~scanf("%d",&n))
{
memset(vis,0,sizeof(vis));//不能省啊。。。。。
memset(dp,0,sizeof(dp));
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++)
scanf("%d",&dp[i][1]);
int s,fa;
int node=1;
while(~scanf("%d%d",&s,&fa),fa+s)
{
f[s]=fa;
node=fa;
}
while(f[node])
{
node=f[node];
}
dfs(node);
printf("%d\n",max(dp[node][0],dp[node][1]));
}
return 0;
}