题目链接:https://www.patest.cn/contests/gplt/L2-013 求联通块的个数,因为时限给的很宽,我们可以每一次都直接重新并查集建图处理,再来统计连通块的个数。 include<cstdio>include<cstring>include<iostream>include<algorithm>usingnamespacestd;constintmaxn=505;intset[maxn],n;structRoad{intu,v;}r[maxn10];intcmp(Roada,Roadb){returna.u...