Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7701 Accepted Submission(s): 3375
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
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
题意:领导去了下属不能去,领导不去下属可以去可以不去
状态转移方程:
//状态转移方程
//dp[u][1] += dp[v][0];领导参加了,则员工一定不参加,因为有些是负数,所以不能直接赋值为0
//dp[u][0] += max(dp[v][1],dp[v][0]);领导没参加,则员工可以参加,可以不参加
//dp[u][1] += dp[v][0];领导参加了,则员工一定不参加,因为有些是负数,所以不能直接赋值为0
//dp[u][0] += max(dp[v][1],dp[v][0]);领导没参加,则员工可以参加,可以不参加
主要的就是怎么建树以及用dfs来访问下属等
#include <iostream>
#include <string>
#include <cstdlib>
#include <algorithm>
#define N 6005
using namespace std;
//状态转移方程
//dp[u][1] += dp[v][0];领导参加了,则员工一定不参加
//dp[u][0] += max(dp[v][1],dp[v][0]);领导没参加,则员工可以参加,可以不参加
struct node
{
int v,next;
}list[N<<1];
int dp[N][2];
int fr[N];//找到root
int e,head[N];
void merge(int v,int u)//对于两个同事有同一个上司
{
list[e].v = v;
list[e].next = head[u];
head[u] = e++;
}
int dfs(int u)
{
for(int i=head[u];i!=-1;i=list[i].next)
{
int v = list[i].v;
dfs(v);
dp[u][0] += max(dp[v][0],dp[v][1]);
dp[u][1] += dp[v][0];
}
return max(dp[u][0],dp[u][1]);
}
int main()
{
int i,j,k,m,n,t;
int u,v;
while(cin>>t)
{
memset(head,-1,sizeof(head));
memset(dp,0,sizeof(dp));
memset(fr,0,sizeof(fr));
e=0;
for(i=1;i<=t;i++)
{
cin>>dp[i][1];
fr[i]=0;
}
while(cin>>v>>u,u && v)
{
merge(v,u);
fr[v]++;
}
int ans = 0;
for(i=1;i<=t;i++)
{
if(!fr[i])
ans += dfs(i);
}
cout<<ans<<endl;
}
}