zoukankan      html  css  js  c++  java
  • hdu 1856 More is better

    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.
     
    又是一道并查集的题目
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    using namespace std;
    struct node
    {
        int num,root;
    }tree[10000005];
    
    int find(int x)
    {
        return x==tree[x].root?x:tree[x].root=find(tree[x].root);
    }
    
    void init()
    {
        for (int i=0;i<=10000001;i++)
        {
            tree[i].num=0;
            tree[i].root=i;
        }
    }
    
    int main()
    {
        int n,x,y,maxn;
        while (scanf("%d",&n)!=EOF)
        {
            init();
            maxn=0;
            for (int i=0;i<n;i++)
            {
                scanf("%d%d",&x,&y);
                maxn=max(maxn,x);
                maxn=max(maxn,y);
                x=find(x);
                y=find(y);
                if (x!=y) tree[x].root=y;
            }
            int ans=0;
            for (int i=0;i<=maxn;i++)
            {
                tree[find(i)].num++;
                if (ans<tree[find(i)].num) ans=tree[find(i)].num;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
     
    至少做到我努力了
  • 相关阅读:
    Web性能压力测试工具之ApacheBench(ab)详解
    微服务监控之三:Prometheus + Grafana Spring Boot 应用可视化监控
    Sentinel-dashboard
    Java8之默认方法和静态接口方法
    蓝绿部署、红黑部署、AB测试、灰度发布、金丝雀发布、滚动发布的概念与区别
    JAVA8 十大新特性详解
    Java链式方法 连贯接口(fluent interface)
    分布式计算概念一览
    Gradle学习
    Java堆外内存之七:JVM NativeMemoryTracking 分析堆外内存泄露
  • 原文地址:https://www.cnblogs.com/chensunrise/p/3719757.html
Copyright © 2011-2022 走看看