24/02/15总结

P1396 营救

思路：直接用kruskal从最小排序一下，直到s和t点相通，目前的拥挤度就是答案
ac：

#include "iostream"
#include "algorithm"
using std::cin;
using std::cout;
using std::endl;
using std::sort;
int a[10005];
int n, m, s, t;
struct point {
	int u, v, w;
}b[20005];

bool cmp(point a, point b) {
	return a.w < b.w;
}

int find(int x) {
	if (a[x] == x)return x;
	else return a[x] = find(a[x]);
}

void Union(int t1, int t2) {
	a[find(t1)] = find(t2);
}
int main() {
	cin >> n >> m >> s >> t;
	for (int i = 1; i <= n; i++)
		a[i] = i;
	for (int i = 1; i <= m; i++) {
		cin >> b[i].u >> b[i].v >> b[i].w;
	}
	sort(b + 1, b + 1 + m, cmp);
	for (int i = 1; i <= m; i++) {
		if (find(b[i].u) != find(b[i].v))
		{
			Union(b[i].u, b[i].v);
		}
		if (find(s) == find(t))
		{
			cout << b[i].w;
			return 0;
		}
	}
}