解题方法:并查集
并查集详解
https://blog.csdn.net/the_best_man/article/details/62416938
#include<iostream>
#include<cstdio>
#include<map>
using namespace std;
map<int ,int >father;
map<int ,int >size;
void Initial(int n)
{
for(int i=1;i<=n;i++)
{
father[i]=i;
size[i]=1;
}
}
int Find(int x)
{
int r=x;
while(r!=father[r])
r=father[r];
while(father[x]!=r)
{
int temp=father[x];
father[x]=r;
x=temp;
}
return r;
}
void Union(int a,int b)
{
int x=Find(a);
int y=Find(b);
if(x!=y)
{
if(size[x]>size[y])
{
father[y]=x;
size[x]+=size[y];
}
else
{
father[x]=y;
size[y]+=size[x];
}
}
}
int main()
{
int n,m;
while(cin>>n)
{
if(n==0)
break;
Initial(n);
cin>>m;
for(int i=1;i<=m;i++)
{
int a,b;
cin>>a>>b;
Union(a,b);
}
int ans=0;
for(int i=1;i<=n;i++)
if(father[i]==i)
ans++;
printf("%d\n",ans-1);
}
return 0;
}