• HDU Problem 1856 More is better 【并查集】


    More is better

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

    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:  1325 1879 1875 1198 1162 
     
    找最大的树
    #include <bits/stdc++.h>
    #define MAX_N 10000005
    using namespace std;
    
    int par[MAX_N], len[MAX_N], n;
    bool vis[MAX_N];
    void init() {
        for(int i = 1;i < MAX_N; i++){
            par[i] = i;
            vis[i] = false;
            len[i] = 1;
        }
    }
    int Find(int x) {
        if(x == par[x])  return x;
        return par[x] = Find(par[x]);
    }
    void unite(int x, int y) {
        int fx = Find(x);
        int fy = Find(y);
        if(fx == fy) return ;
        if(len[fx] >= len[fy]) {
            par[fy] = fx;
            len[fx] = len[fx] + len[fy];
        }
        else {
            par[fx] = fy;
            len[fy] = len[fy] + len[fx];
        }
    }
    int main() {
        int a, b;
        while (scanf("%d", &n) != EOF) {
            init();
            if(n==0){
                printf("1
    ");
                continue;
            }
            for (int i = 0; i < n; i++) {
                scanf("%d%d", &a, &b);
                vis[a] = true, vis[b] = true; unite(a, b);
            }
            int ans = 0;
            for (int i = 1; i <= 10000000; i++) {
                if (vis[i] && par[i] == i) {
                    ans = max(ans, len[i]);
                }
            }
            printf("%d
    ", ans);
        }
        return 0;
    }

  • 相关阅读:
    由博客园页面样式挖出的一款心机软件
    SQL Server 各任务所维护
    [转载]SQL Server查找包含某关键字的存储过程3种方法
    Hibernate简单注解开发和事务处理(四)
    Hibernate实现简单的CRUD操作和常见类(三)
    Hibernate中hibernate.cfg.xml文件和Xxx.hbm.xml文件的详细解释(二)
    Hibernate开发环境的简单搭建及常见错误(一)
    Struts2配置异常错误处理(十六)
    Struts2实现类型转换器(十五)
    Struts2实现JSON和Ajax操作(十四)
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770881.html
Copyright © 2020-2023  润新知