Anniversary party
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5008 Accepted Submission(s): 2298
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
Source
简单树形DP,DP[i][0]表示不去第i个,dp[i][1]表示取第i个,那么dp[i][0]的子节点有两种可能,取过和没取都可以,dp[i][1]子节点只有一种可能,没取。
代码:
//78ms 504k
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn=6000+100;
int dp[maxn][2];
int a[maxn];
int root[maxn];
vector<int>son[maxn];
void dfs(int p)
{
int len=son[p].size();
for(int i=0;i<len;i++)
dfs(son[p][i]);
dp[p][1]=a[p];
for(int i=0;i<len;i++)
{
dp[p][0]+=max(dp[son[p][i]][0],dp[son[p][i]][1]);
dp[p][1]+=dp[son[p][i]][0];
}
}
int main()
{
int n,x,y;
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
son[i].clear();
root[i]=-1;//存根
dp[i][0]=dp[i][1]=0;
}
while(~scanf("%d%d",&x,&y))
{
if(x==0&&y==0)
break;
root[x]=y;
son[y].push_back(x);
}
int k=1;
while(root[k]!=-1)//找根
k=root[k];
dfs(k);
printf("%d\n",max(dp[k][0],dp[k][1]));
}
return 0;
}
邻接表实现
//62ms
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=6000+100;
struct node
{
int v;
int next;//父节点的位置
}edge[maxn<<1];
int root[maxn];
int head[maxn];//父节点的位置
int a[maxn];
int dp[maxn][2];
int t;
void add(int j,int i)
{
edge[t].v=j;
edge[t].next=head[i];
head[i]=t++;//更新父节点
}
void dfs(int k)
{
dp[k][0]=0;
dp[k][1]=a[k];
for(int i=head[k];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
dfs(v);
dp[k][0]+=max(dp[v][0],dp[v][1]);
dp[k][1]+=dp[v][0];
}
return;
}
int main()
{
int n;
while(~scanf("%d",&n))
{
memset(head,-1,sizeof(head));
t=0;
memset(root,-1,sizeof(root));
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
int x,y;
while(~scanf("%d%d",&x,&y))
{
if(x==0&&y==0)
break;
add(x,y);
root[x]=y;
}
int k=1;
while(root[k]!=-1)
{
k=root[k];
}
dfs(k);
printf("%d\n",max(dp[k][0],dp[k][1]));
}
return 0;
}