int fa[N]={0};
int getfa(int x){
if(fa[x]==x)return x;
return fa[x]=getfa(fa[x]);
}
int merge(int x,int y){
int dx=getfa(x);
int dy=getfa(y);
fa[dx]=dy;
}
//
for(int i=1;i<=n;i++)fa[i]=i;
转载于:https://www.cnblogs.com/Leo-JAM/p/10079272.html
int fa[N]={0};
int getfa(int x){
if(fa[x]==x)return x;
return fa[x]=getfa(fa[x]);
}
int merge(int x,int y){
int dx=getfa(x);
int dy=getfa(y);
fa[dx]=dy;
}
//
for(int i=1;i<=n;i++)fa[i]=i;
转载于:https://www.cnblogs.com/Leo-JAM/p/10079272.html