HDU1232

最新推荐文章于 2021-07-13 16:47:11 发布

lovejl

最新推荐文章于 2021-07-13 16:47:11 发布

阅读量253

点赞数

分类专栏：并查集

本文链接：https://blog.csdn.net/u010365748/article/details/41173373

版权

并查集专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#define MAX 1005
int father[MAX],rank[MAX];
int findfather(int a){
    if(father[a]==a)
        return a;
    return father[a]=findfather(father[a]);
}
void Union(int a,int b){
    int fa=findfather(a);
    int fb=findfather(b);
    if(fa==fb) return;
    if(rank[fa]==rank[fb]){
        father[fb]=fa;
        rank[fa]++;
    }
    else if(rank[fa]<rank[fb])
        father[fa]=fb;
    else
        father[fb]=fa;
}
int main(){
//    freopen("in.txt","r",stdin);
    int N,M,i,a,b;
    while(scanf("%d%d",&N,&M)&&N){
        memset(rank,0,sizeof(rank));
        for(i=1;i<=N;++i) father[i]=i;
        for(i=1;i<=M;++i){
            scanf("%d%d",&a,&b);
            Union(a,b);
        }
        a=-1;
        for(i=1;i<=N;++i){
            if(father[i]==i)
                ++a;
        }
        printf("%d\n",a);
    }
    return 0;
}