zoukankan      html  css  js  c++  java
  • 【poj3107】 Godfather

    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 aibi means that the gangster ai has communicated with the gangster bi. 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

    题解

    同【poj1655】

    这题要求排序输出所有可能的重心

    数据卡STL(我也不知道怎么卡的)

    所以要前向星来存图,用栈来存答案

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<cstring>
     5 #define ll long long
     6 #define inf 0x7fffffff
     7 using namespace std;
     8 long long read(){
     9     int x=0,f=1; char ch=getchar();
    10     while(ch<'0'||ch>'9'){ if(ch=='-')f=-1;ch=getchar();}
    11     while(ch>='0'&&ch<='9'){ x=x*10+ch-'0';ch=getchar();}
    12     return x*f; 
    13 }
    14 int T,n,mn,top,cnt;
    15 int size[50005],mx[50005],ans[50005],last[50005];
    16 struct edge{
    17     int to,next;
    18 }e[100005];
    19 void add(int u,int v){
    20     e[++cnt].to=v;e[cnt].next=last[u];last[u]=cnt;
    21     e[++cnt].to=u;e[cnt].next=last[v];last[v]=cnt;
    22 }
    23 void dp(int x,int fa){
    24     size[x]=1;
    25     for(int i=last[x];i;i=e[i].next){
    26         int y=e[i].to;
    27         if(y==fa) continue;
    28         dp(y,x);
    29         size[x]+=size[y];
    30         mx[x]=max(mx[x],size[y]);
    31     }
    32     mx[x]=max(mx[x],n-size[x]);
    33     if(mx[x]<mn){
    34         mn=mx[x];
    35         top=0;
    36     }
    37     if(mx[x]==mn) ans[++top]=x;
    38 }
    39 int main(){
    40     ios::sync_with_stdio(false);
    41     n=read();
    42     mn=inf;
    43     for(int i=1;i<n;i++){
    44         int u=read(),v=read();
    45         add(u,v);
    46     }
    47     dp(1,0);
    48     sort(ans+1,ans+top+1);
    49     for(int i=1;i<=top;i++) cout<<ans[i]<<" ";
    50     return 0;
    51 }
  • 相关阅读:
    Nginx配置简单说明
    JVM需要知道的一些设置参数
    Maven仓库(私服)中上传第三方jar包
    maven本地资源库设置
    sweetalert2使用教程
    《算法导论》学习笔记——二叉搜索树
    散列表
    跨域请求
    mvn常用命令
    Springmvc配置笔记
  • 原文地址:https://www.cnblogs.com/Emine/p/7541473.html
Copyright © 2011-2022 走看看