Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10252 Accepted Submission(s): 4332
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
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
题意:给定N,代表有N个人,接着N行数,代表每个人的价值,接着有很多行,每行有L和K,代表K是L的父节点,父节点和子节点不能同时选取,求出最大选取总价值。
思路:状态转移方程(i是j的父节点)
DP[i][0]=max(DP[j][0],DP[j][1])
DP[i][1]=DP[j][0]
代码
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
const int maxn=6005;
int Father[maxn];//i的父节点是Father[i]
int DP[maxn][2];
bool vis[maxn];
int N;
void DFS(int root)
{
vis[root]=true;
for(int i=1; i<=N; i++)
{
if(Father[i]==root&&vis[i]==false)
{
DFS(i);
DP[root][0]+=max(DP[i][0],DP[i][1]);
DP[root][1]+=DP[i][0];
}
}
}
int main()
{
while(scanf("%d",&N)!=EOF)
{
memset(Father,-1,sizeof(Father));
memset(DP,0,sizeof(DP));
memset(vis,false,sizeof(vis));
for(int i=1; i<=N; i++)
scanf("%d",&DP[i][1]);
int L,K;
while(scanf("%d%d",&L,&K)&&L&&K)
Father[L]=K;//L的上司是K
for(int i=1; i<=N; i++)
if(Father[i]==-1)//找到根节点
{
DFS(i);
printf("%d\n",max(DP[i][0],DP[i][1]));
break;
}
}
return 0;
}