题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1232
题意:n
个点,m
条边,问最少需要多少条边将这些点全部联通。
思路:裸并查集,统计有多少个联通块。
代码:
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
const int N = 1e3 + 10;
int n, m;
int f[N];
int _find(int x) {
return f[x] = (f[x] == x ? x : _find(f[x]));
}
int main() {
while (scanf("%d", &n) != EOF) {
if (!n)
break;
scanf("%d", &m);
for (int i = 1; i <= n; i++)
f[i] = i;
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d%d", &u, &v);
int fu = _find(u);
int fv = _find(v);
if (fu != fv)
f[fu] = fv;
}
for (int i = 1; i <= n; i++)
f[i] = _find(i);
sort(f + 1, f + n + 1);
int left = 0, t = f[1];
for (int i = 2; i <= n; i++) {
if (f[i] != t) {
t = f[i];
left++;
}
}
printf("%d\n", left);
}
return 0;
}