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
题意:在一个聚会里,每个人都有一个快乐值。上司和下属不能同时出现在聚会里。问总的快乐值最大为多少?
思路:因为保障了每个人之间都有关系。所以可以根据上司和下属的关系建树。下属的父节点就是上司。显然,如果上司不去,那么它的每一个下属可以去或者不去。如果上司去,那么它每一个下属都不能去了。
用dp[i][0]和dp[i][1]分别表示i去和不去以i为根节点的子树快乐值的和的最大值。
dp[i][1]=sigma(dp[j][0]),j为i的子节点
dp[i][0]=sigma(max(dp[j][0],dp[j][1])).
用dfs从根节点往下,先计算叶节点再回溯回来,这样可以保证最优化和无后效性。
#include <cmath>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <string>
#include <set>
using namespace std;
#define MAXN 6010
#define LEN 1000000
#define INF 1e9+7
#define MODE 1000000
typedef long long ll;
int n;
int dp[MAXN][2],f[MAXN];
bool used[MAXN];
int a[MAXN];
void dfs(int x)
{
used[x]=true;
for(int i=1;i<=n;i++)
{
if(!used[i]&&f[i]==x)
{
dfs(i);
dp[x][0]+=max(dp[i][1],dp[i][0]);
dp[x][1]+=dp[i][0];
}
}
}
int main()
{
while(scanf("%d",&n)!=EOF){
memset(dp,0,sizeof(dp));
memset(f,0,sizeof(f));
for(int i=1;i<=n;i++){
used[i]=false;
scanf("%d",a+i);
dp[i][1]=a[i];
}
int x,y;
int root=0;
while(scanf("%d%d",&x,&y))
{
if(x==0&&y==0)
break;
f[x]=y;
if(f[x]==y||1)
root=y;
}
while(f[root])
root=f[root];
dfs(root);
printf("%d\n",max(dp[root][0],dp[root][1]));
}
}