zoukankan      html  css  js  c++  java
  • hdu 1856 More is better (并查集)

    More is better

    Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)
    Total Submission(s): 11952    Accepted Submission(s): 4417


    Problem Description
    Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements.

    Mr Wang selected a room big enough to hold the boys. The boy who are not been chosen has to leave the room immediately. There are 10000000 boys in the room numbered from 1 to 10000000 at the very beginning. After Mr Wang's selection any two of them who are still in this room should be friends (direct or indirect), or there is only one boy left. Given all the direct friend-pairs, you should decide the best way.
     
    Input
    The first line of the input contains an integer n (0 ≤ n ≤ 100 000) - the number of direct friend-pairs. The following n lines each contains a pair of numbers A and B separated by a single space that suggests A and B are direct friends. (A ≠ B, 1 ≤ A, B ≤ 10000000)
     
    Output
    The output in one line contains exactly one integer equals to the maximum number of boys Mr Wang may keep. 
     
    Sample Input
    4 1 2 3 4 5 6 1 6 4 1 2 3 4 5 6 7 8
     
    Sample Output
    4 2
    Hint
    A and B are friends(direct or indirect), B and C are friends(direct or indirect), then A and C are also friends(indirect). In the first sample {1,2,5,6} is the result. In the second sample {1,2},{3,4},{5,6},{7,8} are four kinds of answers.
     
    Author
    lxlcrystal@TJU
     
    Source
     
    Recommend
    lcy   |   We have carefully selected several similar problems for you:  1213 1325 1198 1301 1829 
     
     1 //359MS    78584K    889 B    G++
     2 /*
     3 
     4     题意:
     5         给出n对朋友关系,求直接或间接认识的最大的集体
     6         
     7     并查集:
     8         赤裸裸的并查集,直接并查集解法,注意数组大小和没朋友关系的情况。 
     9 
    10 */ 
    11 #include<stdio.h>
    12 #include<string.h>
    13 int set[10000005];
    14 int num[10000005];
    15 int find(int x)
    16 {
    17     if(set[x]==x) return x;
    18     return find(set[x]);
    19 }
    20 void merge(int a,int b)
    21 {
    22     int x=find(a);
    23     int y=find(b);
    24     if(x>y) set[x]=y;
    25     else set[y]=x;
    26 }
    27 int main(void)
    28 {
    29     int n,a,b;
    30     while(scanf("%d",&n)!=EOF)
    31     {
    32         int m=0;
    33         for(int i=0;i<10000005;i++) set[i]=i;
    34         for(int i=0;i<n;i++){
    35             scanf("%d%d",&a,&b);
    36             merge(a,b);
    37             if(a>m) m=a;
    38             if(b>m) m=b;
    39         }
    40         memset(num,0,sizeof(num));
    41         int cnt=0;
    42         for(int i=1;i<=m;i++){
    43             int t=find(set[i]);
    44             num[t]++;
    45             if(num[t] > cnt) cnt=num[t];
    46         } 
    47         if(cnt==0) printf("1
    "); //没朋友关系时只能留一个 
    48         else printf("%d
    ",cnt);    
    49     }
    50     return 0;
    51 } 
  • 相关阅读:
    SqlServer查询所有表名 查询表的所有列名
    IIS控制txt文件的访问
    CHM文件打不开
    [转]VS 2010项目中添加lib库
    SqlServer游标
    [转]_beginthread(), _beginthreadex()与CreateThread()的区别
    jquery radio快速度取值
    linx niginx下php无法创建文件夹及文件
    [转载]无效的 CurrentPageIndex 值.它必须大于等于 0 且小于 PageCount
    使用DateGrid的ItemCommand的一点心得
  • 原文地址:https://www.cnblogs.com/GO-NO-1/p/3596729.html
Copyright © 2011-2022 走看看