首页 > > 程序设计 > C/C++ >

【poj1655】Balancing Act

2018-06-17 21:54:17来源：未知阅读 ()

Description

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be the size of the largest tree in the forest T created by deleting that node from T.
For example, consider the tree:

Deleting node 4 yields two trees whose member nodes are {5} and {1,2,3,6,7}. The larger of these two trees has five nodes, thus the balance of node 4 is five. Deleting node 1 yields a forest of three trees of equal size: {2,6}, {3,7}, and {4,5}. Each of these trees has two nodes, so the balance of node 1 is two.For each input tree, calculate the node that has the minimum balance. If multiple nodes have equal balance, output the one with the lowest number.

Input

The first line of input contains a single integer t (1 <= t <= 20), the number of test cases. The first line of each test case contains an integer N (1 <= N <= 20,000), the number of congruence. The next N-1 lines each contains two space-separated node numbers that are the endpoints of an edge in the tree. No edge will be listed twice, and all edges will be listed.

Output

For each test case, print a line containing two integers, the number of the node with minimum balance and the balance of that node.

Sample Input

Sample Output

1 2

题意

求树的重心，即选择一个结点删去，使得分出的若干棵树的结点数的最大值最小

题解

用size[x]表示x子树的结点数

size[x]=Σsize[yi];

mx[x]表示删去x之后的最大子树结点数

mx[x]=max{size[yi],n-size[x]};

取mx最小的结点，若有多个，取编号最小的

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<vector>
 6 #define maxn 20005
 7 #define inf 0x7fffffff 
 8 using namespace std;
 9 long long read(){
10     int x=0,f=1; char ch=getchar();
11     while(ch<'0'||ch>'9'){ if(ch=='-') f=-1;ch=getchar();}
12     while(ch>='0'&&ch<='9'){ x=x*10+ch-'0';ch=getchar();}
13     return x*f;
14 }
15 int T,n,ans;
16 int size[maxn],mx[maxn];
17 vector<int> e[maxn];
18 void dp(int x,int fa){
19     size[x]=1;
20     for(int i=0;i<e[x].size();i++){
21         int y=e[x][i];
22         if(y==fa) continue;
23         dp(y,x);
24         size[x]+=size[y];
25         mx[x]=max(mx[x],size[y]);
26     }
27     mx[x]=max(mx[x],n-size[x]);
28     if(mx[x]<mx[ans]) ans=x;
29     if(mx[x]==mx[ans]&&x<ans) ans=x;
30 }
31 int main(){
32     T=read();
33     while(T--){
34         n=read();ans=0;
35         mx[0]=inf;
36         for(int i=1;i<n;i++){
37             int u=read(),v=read();
38             e[u].push_back(v);
39             e[v].push_back(u);
40         }
41         dp(1,0);
42         printf("%d %d\n",ans,mx[ans]);
43         for(int i=1;i<=n;i++) e[i].clear();
44         memset(size,0,sizeof(size));
45         memset(mx,0,sizeof(mx));
46     }
47     return 0;
48 }