poj2342 Anniversary party poj2342 Anniversary party

poj2342 Anniversary party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9144		Accepted: 5259

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

1 3

2 3

6 4

7 4

4 5

3 5

0 0

Sample Output

Source

Ural State University Internal Contest October'2000 Students Session

大致题意：

某公司要举办一次晚会，但是为了使得晚会的气氛更加活跃，每个参加晚会的人都不希望在晚会中见到他的直接上司，现在已知每个人的活跃指数和上司关系（当然不可能存在环），求邀请哪些人（多少人）来能使得晚会的总活跃指数最大。

分析：

思路：

任何一个点的取舍可以看作一种决策，那么状态就是在某个点取的时候或者不取的时候，以他为根的子树能有的最大活跃总值。分别可以用f[i,1]和f[i,0]表示第i个人来和不来。

上司来,下属不来

当i来的时候，dp[i][1] += dp[j][0];//j为i的下属

上司不来，下属来或不来

当i不来的时候，dp[i][0] +=max(dp[j][1],dp[j][0]);//j为i的下属

1、这里树的储存结构

　　直接记录每个节点的父亲节点father[i]

　　所以DP的时候直接去找他的孩子，其实我们可以用图的方式来存树，树时特殊的图

2、状态中i的含义：

　　以i节点为根的子树能有的最大活跃总值,i就是i号节点

3、初始化问题，所以dp[i][1]=a[i]的值

4、因为求最大活跃，所以dp数组初始化为0

5、用vis数组做dfs

6、一个上司的下属之间是并列关系

7、从叶子节点开始DP

8、知道dp[i][1]和dp[i][0]的初始值

9、储存结构+算法的模式

10、就是个后序遍历

 1 #include<iostream>  
 2 #include<cmath>  
 3 #include<algorithm>  
 4 #include<vector>  
 5 #include<cstdio>  
 6 #include<cstdlib>  
 7 #include<cstring>  
 8 #include<string>  
 9   
10 using namespace std;  
11   
12 #define maxn 6005  
13   
14 int n;  
15 int dp[maxn][2],father[maxn];//dp[i][0]0表示不去，dp[i][1]1表示去了  
16 bool visited[maxn];  
17   
18 void tree_dp(int node)  
19 {  
20     int i;  
21     visited[node] = 1;  
22     for(i=1; i<=n; i++) //找1到n中找node节点的下属 
23     {  
24         if(!visited[i]&&father[i] == node)//i为下属  
25         {  
26             tree_dp(i);//递归调用孩子结点，从叶子结点开始dp  
27             //关键  
28             dp[node][1] += dp[i][0];//上司来,下属不来  
29             dp[node][0] +=max(dp[i][1],dp[i][0]);//上司不来，下属来、不来  
30         }  
31     }  
32 }  
33   
34 int main()  
35 {  
36     int i;  
37     int f,c,root;  
38     while(scanf("%d",&n)!=EOF)  
39     {  
40         memset(dp,0,sizeof(dp));  
41         memset(father,0,sizeof(father));  
42         memset(visited,0,sizeof(visited));  
43         for(i=1; i<=n; i++)  
44         {  
45             scanf("%d",&dp[i][1]);  
46         }  
47         root = 0;//记录父结点  
48         bool beg = 1;  
49         while (scanf("%d %d",&c,&f),c||f)  
50         {  
51             //c的老爸是f 
52             father[c] = f;
53             //儿子是跟节点   或者这条边是第一条边
54             //父亲做根节点  
55             if( root == c || beg )  
56             {  
57                 root = f;  
58             }  
59         }  
60         //循环寻找根节点 
61         while(father[root])//查找父结点  
62             root=father[root];  
63         //从根节点开始树形dp 
64         tree_dp(root);  
65         //取最大的上司去或者不去中的大值 
66         int imax=max(dp[root][0],dp[root][1]);  
67         printf("%d
",imax);  
68     }  
69     return 0;  
70   
71 }

poj2342 Anniversary party
poj2342 Anniversary party

 1 #include <iostream>
 2 #include <cstdio>
 3 const int N=6e3+10;
 4 using namespace std;
 5 int f[N][2],fa[N],n,root;
 6 bool vis[N];
 7 
 8 /*
 9 f[i][0]的初始值是0，而不是负无穷大，因为初始的时候是为0的，我们要用这个数来加的 
10 */ 
11 void init(){
12     while(scanf("%d",&n)!=EOF){
13         for(int i=1;i<=n;i++) cin>>f[i][1];
14         int l,k;
15         while(scanf("%d%d",&l,&k),l||k) fa[l]=k,root=k;
16     }
17     while(fa[root]) root=fa[root];
18 }
19 
20 void dfs(int root){
21     for(int i=1;i<=n;i++) if(!vis[i]&&fa[i]==root){
22         vis[i]=true;
23         dfs(i);
24         f[root][1]+=f[i][0];
25         f[root][0]+=max(f[i][0],f[i][1]);
26     }
27 }
28 
29 int main(){
30     //freopen("in.txt","r",stdin);
31     init();
32     vis[root]=true;
33     dfs(root);
34     int ans=max(f[root][0],f[root][1]);
35     cout<<ans<<endl;
36     return 0;
37 }

暴力，没过

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <vector>
 4 const int N=6e3+10;
 5 using namespace std;
 6 int n,fa[N],w[N],root;
 7 vector<int> vct[N];
 8 
 9 int search(int root,int type){
10     if(type==0){//上司没来 
11         int tmp=0;
12         for(int i=0;i<vct[root].size();i++){
13             int v=vct[root][i];
14             tmp+=max(search(v,0),search(v,1));
15         }  
16         return tmp; 
17     }
18     if(type==1){//上司来了，下属不来 
19         int tmp=w[root];// 
20         for(int i=0;i<vct[root].size();i++){
21             int v=vct[root][i];
22             tmp+=search(v,0);
23         }  
24         return tmp; 
25     }
26 }
27 
28 int main(){
29     //freopen("in.txt","r",stdin);
30     while(scanf("%d",&n)!=EOF){
31         for(int i=1;i<=n;i++) cin>>w[i];
32         int c,f;
33         while(scanf("%d %d",&c,&f),c||f){
34             vct[f].push_back(c);//孩子父亲表示法 
35             fa[c]=f; root=f;
36         } 
37         while(fa[root]) root=fa[root];
38         int ans=max(search(root,0),search(root,1));
39         cout<<ans<<endl;
40     }
41     
42 }

poj2342 Anniversary party poj2342 Anniversary party

相关推荐