原题目:
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
中文概要:
一个树,每个点有一个“快乐”值,父子结点不能同时快乐,问这个结构的最大快乐值。
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 6010;
vector<int> G[maxn];//储存tree
int father[maxn];
//father数组表示向上找父亲节点
int dp[maxn][2];
//dp[u][0]表示不选取u节点后u子树能够得到的最大值
//dp[u][1]表示选取u节点后u子树能够得到的最大值
void dfs(int root)
{
for(int i=0;i<G[root].size();i++)
{
dfs(G[root][i]);
}
for(int i=0;i<G[root].size();i++)
{
dp[root][0]+=max(dp[G[root][i]][0],dp[G[root][i]][1]);
dp[root][1]+=dp[G[root][i]][0];
}
}
int main()
{
int n;
scanf("%d",&n);
memset(dp,0,sizeof(dp));
memset(father,-1,sizeof(father));
for(int i=1;i<=n;i++)
{
scanf("%d",&dp[i][1]);
G[i].clear();
}
int fa,so;
while(scanf("%d%d",&so,&fa)&&fa&&so)
{
G[fa].push_back(so);
father[so]=fa;
}
int root=1;
while(father[root]!=-1)
root=father[root];
dfs(root);
printf("%d\n",max(dp[root][0],dp[root][1]));
return 0;
}
思路:
思考如何写出树规方程,即思考根与子节点的关系。
dp[i][0]:表示不邀请i员工其子树达到的最大快乐值,dp[i][1]则表示邀请。
这时根与子节点的关系就显然了。
分成了好多数组,有点晕。。。