【ybtoj】【luogu】【最小生成树】【例题1】繁忙都市

---

Link

传送门
题目
luogu

---

解题思路

最小生成树模板

---

Code

#include <algorithm>
#include <iostream>
#include <cstdio>

using namespace std;

struct DT{
	int x, y, s;
}a[100100];
int n, m, fa[310], xx, yy, ans_num, ans_max; 

bool cmp(const DT&k, const DT&l) {
	return (k.s < l.s);
}

int find(int x) {  
	if (fa[x] != x)
		fa[x] = find(fa[x]);
	return fa[x];
} 

int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++)
		scanf("%d %d %d", &a[i].x, &a[i].y, &a[i].s);
	sort(a + 1, a + 1 + m, cmp);
	
	for (int i = 1; i <= n; i++)
		fa[i] = i;
	for (int i = 1; i <= m; i++) {
		xx = find(a[i].x), yy = find(a[i].y);
		if (xx != yy) {
			ans_num++;
			ans_max = a[i].s;
			fa[xx] = yy;
		}
	}
	printf("%d %d", ans_num, ans_max);
}