POJ 1655 求树的重心

Balancing Act

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12317		Accepted: 5217

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

1
7
2 6
1 2
1 4
4 5
3 7
3 1

Sample Output

1 2

Source

POJ Monthly--2004.05.15 IOI 2003 sample task

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page  Go Back  To top

题意:给定一棵树,求树的重心的编号以及重心删除后得到的最大子树的节点个数size,如果size相同就选取编号最小的.

分析:首先要知道什么是树的重心,树的重心定义为:找到一个点,其所有的子树中最大的子树节点数最少,那么这个点就是这棵树的重心,删去重

心后，生成的多棵树尽可能平衡.  

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <iostream>
using namespace std;
const int N=200005;
int da,ans;
int head[N];
//int vis[N];
int son[N];
int cnt;
struct node
{
    int v,next;
} edge[N];
void init()
{
    cnt=0;
    memset(head,-1,sizeof(head));
    // memset(vis,0,sizeof(vis));
}
void add(int u,int v)
{
    edge[cnt].v=v;
    edge[cnt].next=head[u];
    head[u]=cnt++;
}
void dfs(int u,int fa,int n)
{
    son[u]=0;
    int res=0;
    for(int i=head[u]; ~i; i=edge[i].next)
    {
        int v=edge[i].v;
        if(v==fa)
            continue;
        dfs(v,u,n);
        son[u]+=son[v]+1;
        res=max(res,son[v]+1);
    }
    res=max(res,n-son[u]-1);
    if(res<da ||res==da &&u<ans)
    {
        da=res;
        ans=u;
    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        cin>>n;
        init();
        for(int i=1; i<=n-1; i++)
        {
            int u,v;
            cin>>u>>v;
            add(u,v);
            add(v,u);
        }
        da=ans=999999999;
        dfs(1,-1,n);
        printf("%d %d\n",ans,da);
    }
    return 0;
}