摘要：#include <iostream>#define M 50005using namespace std;int n,m,fa[M];int find_fa(int x){ while(fa[x]!=x) { x=fa[x]; } return x;}void merg(int x,int y){ if(find_fa(x)!=find_fa(y)) { fa[find_fa(x)]=find_fa(y); }}int main(){ int i,a,b,sum,si=... 阅读全文