zoukankan      html  css  js  c++  java
  • More is better(并差集)

    More is better

    Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 327680/102400K (Java/Other)
    Total Submission(s) : 1   Accepted Submission(s) : 1
    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. [/hint]
    王老师要找一些男生帮助他完成一项工程。要求最后挑选出的男生之间都是朋友关系,可以说直接的,也可以是间接地。问最多可以挑选出几个男生(最少挑一个)。
     思路:加一个数组记录数的元素个数;剩下的并差集解决;
    代码:
     1 #include<stdio.h>
     2 int relate[10000010],num[10000010];//num[]记录个数;
     3 int min;
     4 int find(int x){
     5     int r=x;
     6     while(r!=relate[r])r=relate[r];
     7     int i=x,j;
     8     while(i!=r)j=relate[i],relate[i]=r,i=j;
     9     return r;
    10 }
    11 void initial(){
    12     for(int i=1;i<=10000000;++i)relate[i]=i,num[i]=1;
    13 }
    14 void merge(int x,int y){
    15     int f1,f2;
    16     f1=find(x);f2=find(y);
    17     if(f1!=f2)relate[f1]=f2,num[f2]+=num[f1];
    18     min=min>num[f2]?min:num[f2];
    19 }
    20 int main(){
    21     int n,temp1,temp2;
    22     while(~scanf("%d",&n)){
    23         min=1;initial();
    24         while(n--){
    25             scanf("%d%d",&temp1,&temp2);
    26             merge(temp1,temp2);
    27         }
    28         printf("%d
    ",min);
    29     }
    30     return 0;
    31 }
  • 相关阅读:
    关于MySQL5.6配置文件my-default.ini不生效问题
    jQuery学习总结(三)
    jQuery学习总结(二)
    jQuery学习总结(一)
    mysql输出到页面MVC模式
    简单的在jsp页面操作mysql
    mysql5.7的基本使用
    mysq5.7l的下载与配置
    jdk环境变量的配置
    SQL SERVER——给已有数据的表增加唯一值
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4632170.html
Copyright © 2011-2022 走看看