hdu1856More is better

最新推荐文章于 2022-12-14 05:13:38 发布

原创最新推荐文章于 2022-12-14 05:13:38 发布 · 388 阅读

0 ·

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

标签

#并查集

并查集专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种通过并查集算法解决的最大好友群组数量问题。该问题要求从1到10000000编号的男孩中找出最大的直接或间接朋友群组的人数。文章提供了完整的C++代码实现，利用并查集来合并直接朋友关系，并最终计算出最大的群组规模。

More is better

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

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.
代码如下：
 
#include <iostream>
#include <cstring>
using namespace std;
#define N 10000002
int p[N];
int sum[N];
int Find_set(int x)
{
    return p[x]==0?x:p[x]=Find_set(p[x]);
}
int main()
{
    int n;
    while(cin>>n)
    {
        memset(p,0,sizeof(p));   //初始化每个结点
        for(int i=1;i<=N;i++)
        sum[i]=1;              //初始化每个集合元素的个数都是1
        while(n--)                                                                                                                                                                                                                                                                                                            
        {
            int a,b;
            cin>>a>>b;
            a=Find_set(a);//合并集合中
            b=Find_set(b);
            if(a!=b)
            {
                p[a]=b;
                sum[b]+=sum[a];   //算有几个元素在一个集合中
            }
        }
        int ans=1;
        for(int i=1;i<=N;i++)
        {
            if(p[i]==0&&sum[i]>ans)
                ans=sum[i];
        }
        cout<<ans<<endl;
    }
    return 0;
}