POJ 2342

1. 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

   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

   
   
2. 题意：有一个领导圈，每个领导都有一个层次，并且 每个层次有一个权值，现在领导们要出席一个派对，要求领导和该领导的直系领导不能同时出席，求最大权值
3. 
   
4. #include <fstream>  
5. #include <stdio.h>  
6. #include <iostream>  
7. #include <string.h>  
8. #include <string>  
9. #include <limits.h>  
10. #include <algorithm>  
11. #include <math.h>  
12. #include <numeric>  
13. #include <functional>  
14. #include <ctype.h>  
15. #define MAX 100010  
16. using namespace std;  
17.   
18. struct NODE  
19. {  
20.     int child,father,brother,present,not_present;  
21.     int max()  
22.     {  
23.         return present>not_present?present:not_present;  
24.     }  
25.     void init()  
26.     {  
27.         child=father=brother=not_present=0;  
28.     }  
29. }node[MAX];  
30.   
31. void dfs(const int &idx)  
32. {  
33.     int child=node[idx].child;  
34.     while(child)  
35.     {  
36.         dfs(child);  
37.         node[idx].present+=node[child].not_present;//第idx个参加，则孩子节点不能参加  
38.         node[idx].not_present+=node[child].max();   //第idx个不参加，则孩子节点可参加可不参加  
39.         child=node[child].brother;  
40.     }  
41. }  
42.   
43. int main(void)  
44. {  
45. #ifdef DEBUG    
46.   freopen("../stdin.txt","r",stdin);  
47.   freopen("../stdout.txt","w",stdout);   
48. #endif    
49.   
50.   int n;  
51.   
52.   while(~scanf("%d",&n) && n)  
53.   {  
54.         for(int i=1;i<=n;++i)  
55.         {  
56.             scanf("%d",&node[i].present);  
57.             node[i].init();  
58.         }  
59.         int k,l;  
60.         while(scanf("%d%d",&l,&k) && k+l)  
61.         {  
62.             node[l].father=k;  
63.             node[l].brother=node[k].child;  
64.             node[k].child=l;  
65.         }  
66.         for(int i=1;i<=n;++i)  
67.             if(!node[i].father)  
68.             {  
69.                 dfs(i);  
70.                 printf("%d\n",node[i].max());  
71.                 break;  
72.             }  
73.   }  
74.   
75.   return 0;  
76. }