一开始村庄之间两两不连通,按时间从小到大修复公路,判断两个村庄是否联通,若联通了那就直接看下一条路,若不联通那就修复。直到M条路都遍历完。
重点来了,最早什么时候任意两条村庄都存在至少一条修复完成的道路(可以由多条公路连成一条道路)?
满足条件最少需要几条路??
n个村庄就n-1条呗,输出时判断公路数有没有至少n-1条,有输出时间,没有就-1
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 5;
int n, m, rn = 1, timx = -1e9;
int f[1005];
struct road {
int x, y, t;
}rd[maxn];
bool cmp(road x, road y) {
return x.t < y.t;
}
int find(int x) {
if (f[x] == x)
return x;
return f[x] = find(f[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
f[i] = i;
for (int i = 1; i <= m; i++)
scanf("%d%d%d", &rd[i].x, &rd[i].y, &rd[i].t);
sort(rd + 1, rd + m + 1, cmp);
int a, b;
for (int i = 1; i <= m; i++) {
a = find(rd[i].x);
b = find(rd[i].y);
if (a != b) {
f[a] = b;
rn++;
timx = max(timx, rd[i].t);
}
}
if (rn >= n - 1)
printf("%d\n", timx);
else
printf("-1\n");
system("pause");
return 0;
}