# F - Anniversary party（POJ - 2342 ）

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

AC代码：

#include <stdio.h>
#include <stdlib.h>
#define max(a,b) (a)>(b)?(a):(b)
#include <string.h>
int dp[6001][2];
int father[6001];
int visit[6001];//用来标记是否已经被访问
//全局变量初值默认为，所以不需要在进行初始化。
int n;//员工数目
void dfs(int node)
{
visit[node]=1;//表示已经被访问了
int i;
for(i=1; i<=n; i++)
{
if(visit[i]!=1&&father[i]==node)
{
dfs(i);
dp[node][1]+=dp[i][0];//上司去，则他的直接下属不能去。
dp[node][0]+=max(dp[i][1],dp[i][0]);//上司不去，他的下属可以去，也可以不去
//加上去或不去的最大兴奋值值
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF)//员工数目
{
int i;
int root;//根节点
for(i=1; i<=n; i++)
{
scanf("%d",&dp[i][1]);//重要程度
}
int staff,boss;
while(scanf("%d %d",&staff,&boss),(staff+boss>0))
{
father[staff]=boss;
root=boss;
}
while(father[root])
{
root=father[root];
}
dfs(root);
printf("%d\n",max(dp[root][1],dp[root][0]));
}
return 0;
}


int staff,boss;
while(scanf("%d %d",&staff,&boss),(staff+boss>0))
{
father[staff]=boss;
root=boss;
}
while(father[root])//根节点父亲没有父亲结点，所以它的父亲结点没有赋值，仍为初值0
{
root=father[root];
}

void dfs(int node)
{
visit[node]=1;//表示已经被访问了
int i;
for(i=1; i<=n; i++)
{
if(visit[i]!=1&&father[i]==node)
{
dfs(i);
dp[node][1]+=dp[i][0];//上司去，则他的直接下属不能去。
dp[node][0]+=max(dp[i][1],dp[i][0]);//上司不去，他的下属可以去，也可以不去
//加上去或不去的最大兴奋值值
}
}
}

#include <stdio.h>
#include <stdlib.h>
#define max(a,b) (a)>(b)?(a):(b)
#include <string.h>
int dp[6001][2];
int father[6001];
int visit[6001];//用来标记是否已经被访问
//全局变量初值默认为，所以不需要在进行初始化。
int n;//员工数目
void dfs(int node)
{
visit[node]=1;//表示已经被访问了
int i;
for(i=1; i<=n; i++)
{
if(visit[i]!=1&&father[i]==node)
{
dfs(i);
dp[node][1]+=dp[i][0];//上司去，则他的直接下属不能去。
dp[node][0]+=max(dp[i][1],dp[i][0]);//上司不去，他的下属可以去，也可以不去
//加上去或不去的最大兴奋值值
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF)//员工数目
{
int i;
int root;//根节点
for(i=1; i<=n; i++)
{
scanf("%d",&dp[i][1]);//重要程度
}
int staff,boss;
while(scanf("%d %d",&staff,&boss),(staff+boss>0))
{
father[staff]=boss;
root=boss;
}
while(father[root])//根节点父亲没有父亲结点，所以它的父亲结点没有赋值，仍为初值0
{
root=father[root];
}
dfs(root);
printf("%d\n",max(dp[root][1],dp[root][0]));
}
return 0;
}