poj godfather

Godfather

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 8376		Accepted: 2971

Description

Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arrest the mafia leaders.

Unfortunately, the structure of Chicago mafia is rather complicated. There are n persons known to be related to mafia. The police have traced their activity for some time, and know that some of them are communicating with each other. Based on the data collected, the chief of the police suggests that the mafia hierarchy can be represented as a tree. The head of the mafia, Godfather, is the root of the tree, and if some person is represented by a node in the tree, its direct subordinates are represented by the children of that node. For the purpose of conspiracy the gangsters only communicate with their direct subordinates and their direct master.

Unfortunately, though the police know gangsters’ communications, they do not know who is a master in any pair of communicating persons. Thus they only have an undirected tree of communications, and do not know who Godfather is.

Based on the idea that Godfather wants to have the most possible control over mafia, the chief of the police has made a suggestion that Godfather is such a person that after deleting it from the communications tree the size of the largest remaining connected component is as small as possible. Help the police to find all potential Godfathers and they will arrest them.

Input

The first line of the input file contains n — the number of persons suspected to belong to mafia (2 ≤ n ≤ 50 000). Let them be numbered from 1 to n.

The following n − 1 lines contain two integer numbers each. The pair a_i, b_i means that the gangster a_i has communicated with the gangster b_i. It is guaranteed that the gangsters’ communications form a tree.

Output

Print the numbers of all persons that are suspected to be Godfather. The numbers must be printed in the increasing order, separated by spaces.

Sample Input

6
1 2
2 3
2 5
3 4
3 6

Sample Output

2 3

求删掉某点后子树节点最多的最小。就是求树的重心。别忘了重心要排序后输出。

void dfssize(int u,int fa)  //求子树大小  
{  
    sonsize[u]=1; sonmx[u]=0;  
    for(int i=head[u];~i;i=edge[i].next)  
    {  
        int v=edge[i].to;  
        if(v==fa) continue;  
        dfssize(v,u);  
        sonsize[u] += sonsize[v];  //  DP思想  
        sonmx[u] = max(sonmx[u],sonsize[v]);  //保留最大  
    }  
}  
int root[N];  
int num,minc;  
void dfsroot(int r,int u,int fa) //求根为r的树的重心  
{  
    if(sonsize[r]-sonsize[u] > sonmx[u]) sonmx[u] = sonsize[r]-sonsize[u]; //u节点向上的子树  
    if(sonmx[u]<minc) //子树最大的最小即为重心  
    {  
        minc=sonmx[u];  
        num=0;  
        root[num++]=u;  
    }  
    else if(sonmx[u]==minc)  
    {  
       root[num++]=u;  
    }  
    for(int i=head[u];~i;i=edge[i].next)  
    {  
        int v=edge[i].to;  
        if(v==fa) continue;  
        dfsroot(r,v,u);  
    }  
}