hdu1856 More is better 并查集

最新推荐文章于 2019-08-27 20:47:16 发布

原创最新推荐文章于 2019-08-27 20:47:16 发布 · 303 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

------------解题报告------------- 同时被 2 个专栏收录

208 篇文章

订阅专栏

并查集

11 篇文章

订阅专栏

本文介绍了一个使用并查集算法解决的最大朋友圈问题。问题描述为：在一系列已知的朋友关系中找到最大朋友圈的人数。通过并查集将直接或间接的朋友关系进行合并，并找出人数最多的朋友圈。

More is better

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

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

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

HDU 2007 Programming Contest - Final

当天晚上脑袋真是被门夹了居然看出来了这个是并查集。。。。

题意：

有个人想要举办哲学party，由于这个是哲学party，所以希望男人越多越好，题目会告诉你m对关系，表示a和b是朋友，现在房间的主人要依次从房间里踢人，知道房间内任意两个人是朋友（直接或间接）

那肯定是剩下一个最大的团啊。。。。。那不就是并查集吗？！直接查一查，然后看看谁的子孙最多啊

虽然看那个点给的范围可能会超。。。。反正就写写写，。。。。。

然后特判一下m==0

然后就。。。没了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 10000010;
int pre[N],judge[N];
int maxn,ans;
int Find(int index){
    int r=index;
    while(pre[r]!=r){
        r=pre[r];
    }
    if(pre[index]!=r){
        pre[index]=r;
    }
    return r;
}
void join(int a,int b){
    int i=Find(a);
    int j=Find(b);
    if(i!=j){
        pre[i]=j;
        judge[j]+=judge[i];
    }
}
int main(){
    int n,a,b,maxn;
    while (~scanf("%d",&n)) {
        ans = 1;
        maxn = 0;
        for(int i=1;i<N;i++){
            pre[i] = i;
            judge[i] = 1;
        }
        for(int i=0;i<n;i++){
            scanf("%d%d",&a,&b);
            maxn = max(maxn,max(a,b));
            join(a, b);
        }
        for(int i=1;i<=maxn;i++){
            ans = max(ans,judge[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}