思路:求联通块数量,只需要联通块数量减一条边即可让所有点直接或者间接连通。
AC代码
#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int>
typedef long long LL;
const int maxn = 1000 + 5;
int root[maxn], p[maxn];
int find(int x) {
return p[x] == x ? x : p[x] = find(p[x]);
}
void combine(int x, int y) { //合并两个节点
int pre_x = find(x), pre_y = find(y);
if(pre_x != pre_y) p[pre_x] = y;
}
int main() {
int n, m;
while(scanf("%d", &n) == 1 && n) {
for(int i = 1; i <= n; ++i) p[i] = i; //初始化并查集
scanf("%d", &m);
int x, y;
for(int i = 0; i < m; ++i) {
scanf("%d%d", &x, &y);
combine(x, y);
}
memset(root, 0, sizeof(root));
for(int i = 1; i <= n; ++i) root[find(i)] = 1;
int ans = 0;
for(int i = 1; i <= n; ++i) ans += root[i];
printf("%d\n", ans-1);
}
return 0;
}
如有不当之处欢迎指出!