Anniversary party
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6982 | Accepted: 4018 |
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
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
sddf
#include"iostream"
#include"cstring"
#include"math.h"
#include"cstdio"
#include"map"
#include"set"
#include"algorithm"
#include"vector"
#include"queue"
using namespace std;
typedef long long ll;
const int maxn=6000+20;
const int INF=100000000;
int visit[maxn];
int dp[maxn][1<<1]; //分两种状态 这个点来 或者 不来
int father[maxn]; //记录父节点
int n;
void dfs(int root)
{
visit[root]=1;
for(int i=1;i<=n;i++)
{
if(father[i]==root&&visit[i]==0)
{
dfs(i); //递归求解出子节点的最大值,结束之后求解父节点
dp[root][0]+=max(dp[i][1],dp[i][0]); //当父节点不来的时候,子节点中来或者不来选择大的那一个
dp[root][1]+=dp[i][0]; //当父节点来的时候 子节点只能选择不来
}
}
}
int main()
{
while(cin>>n)
{
memset(visit,0,sizeof(visit));
memset(father,-1,sizeof(father));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
scanf("%d",&dp[i][1]);
for(;;){int son,fat;scanf("%d%d",&son,&fat);if(son+fat==0) break;father[son]=fat;}
int root=1;
while(father[root]!=-1) //找到根节点
root=father[root];
dfs(root);
cout<<max(dp[root][0],dp[root][1])<<endl; //来或者不来之中选择大的
}
return 0;
}