Anniversary party
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 8765 Accepted: 5031
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
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
Source
Ural State University Internal Contest October’2000 Students Session
题意:有一个年终派对,每个员工都有一个活跃值,每个员工都有一个直接上属,每个人都不想在派对上见到自己的直接上司,问最多的活跃值总和
转移方程:dp[i][1]表示i来且以i为根的子树能获得的最大活跃值,dp[i][0]就是i不来获得的最大活跃值
dp[i][1]=∑(dp[j][0])j的直接上司是j
dp[i][0]=∑(max(dp[j][0],dp[j][1]));
然后递归下去,回溯由叶子求根的最大值就可以了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#define maxn 6010
using namespace std;
vector<int > f[maxn];
int dp[maxn][4];
int n;
int d[maxn];
int pre[maxn];
void dfs(int x)
{
dp[x][1]=d[x];
for(int i=0;i<f[x].size();i++)
{
int cur=f[x][i];
dfs(cur);
dp[x][1]+=dp[cur][0];
dp[x][0]+=max(dp[cur][0],dp[cur][1]);
}
}
void solve()
{
int x=1;
while(pre[x]!=-1){
x=pre[x];
}
dfs(x);
printf("%d\n",max(dp[x][0],dp[x][1]));
}
void init()
{
memset(pre,-1,sizeof(pre));
for(int i=1;i<=n;i++)
{
f[i].clear();
}
memset(dp,0,sizeof(dp));
}
int main()
{
int a,b;
while(scanf("%d",&n)==1)
{
init();
for(int i=1;i<=n;i++)scanf("%d",&d[i]);
while(scanf("%d%d",&a,&b)==2)
{
if(a==0&&b==0)break;
f[b].push_back(a);
pre[a]=b;
}
solve();
}
return 0;
}