【模板】并查集

#include<iostream>#include<stdio.h>#include<string>#include<string.h>#include<cstring>#include<stack>#include<queue>#include<algorithm>#include<math.h>#include<vector>#include<iomanip>#include<map>#include<list>using namespace std;int parents[100];int find(int x){//找“双亲”if(parents[x]!=x)return parents[x]=find(parents[x]);return x;}bool same(int x,int y){//判断时候有相同“双亲”return find(x)==find(y);}void unio(int x,int y){//合并parents[find(x)]=find(y);}int main(){for(int i=0;i<100;i++)parents[i]=i;//标自己为自己的“双亲”}