摘要： 题目链接。分析：给定 n 个点和 m 条无项边，求连通分量的数量。用并查集很简单。#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <map>#include <queue>#include <cmath>using namespace std;const int maxn = 50000 + 10;int p[maxn];int find(int 阅读全文