m0_46297777的博客

#include<bits/stdc++.h> using namespace std; const int maxn=1e6; int father[maxn]; int Find(int x)//寻找根节点 { if(father[x]==x)return x; return father[x]=Find(father[x]); } void Union(int x,int ...

思路：并查集去做 #include<bits/stdc++.h> using namespace std; const int maxn=1e6; int father[maxn]; int Find(int x) { if(father[x]==x)return x; return father[x]=Find(father[x]); } void Union(int x,in...