并查集C - More is better

最新推荐文章于 2026-06-19 13:27:13 发布

原创最新推荐文章于 2026-06-19 13:27:13 发布 · 640 阅读

0 ·

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

本文介绍了一种通过合并好友关系来找出最大群组规模的算法。该算法利用并查集数据结构实现，针对大量人员（可达一千万级别）的好友关系进行处理，以求得最大的直接或间接好友群组的人数。

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

这样时间超限；

#include<stdio.h>
#define N 10000000
int pre[N],num[N];
int find(int x) /*寻找根节点*/
{
    while(pre[x]!=x)
        x=pre[x];
    return x;
}
void merge(int a,int b)/*合并a和b*/
{
    int p=find(a);
    int q=find(b);
    if(p!=q)
    {
        pre[p]=q;
        num[q]=num[q]+num[p];/*合并集合中元素个数*/
    }
}
int main()
{
    int n,a,b,i,sum,max;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
        {
            printf("1\n");
            continue;
        }
        max=0;
        for(int i=0;i<=N;i++)
        {
            pre[i]=i;
        num[i]=1;/*开始时数量都为1，根节点为自己*/
        }
        for(i=0; i<n; i++)
        {
            scanf("%d%d",&a,&b);
            if(a>max)
                max=a;
            if(b>max)
                max=b;
            merge(a,b); /*合并集合*/
        }
        int Max=0;
        for(i=1; i<=max; i++)
            if(num[i]>Max) /*查找最大值*/
                Max=num[i];
        printf("%d\n",Max);
    }
    return 0;
}
过了的代码：

#include<stdio.h>
int m,rank[10000010],pre[10000010],max;
void make()
{
    int i;
    for(i=0; i<10000010; i++)
    {
        pre[i]=i;
        rank[i]=1;
    }
}
int find(int x)
{
    if(pre[x]!=x)
        x=pre[x];
    return x;
}
void merge(int x,int y)
{
    pre[x]=y;
    rank[y]+=rank[x];
    max=max>rank[y]?max:rank[y];
    rank[x]=0;
}
int main()
{
    int x,y,i;
    while(scanf("%d",&m)!=EOF)
    {
        make();
        max=0;
        for(i=0; i<m; i++)
        {
            scanf("%d%d",&x,&y);
            x=find(x);
            y=find(y);
            if(x!=y)
                merge(x,y);
        }
        if(max)
            printf("%d\n",max);
        else
            printf("1\n");
    }
}