XDU暑训2019 Day4 POJ1797 城市运输

题意：给n个城市m条边，1到n的所有路径中每条路径都有一条最小边，求这些最小边中的最大值
思路：用dijkstra算法求最长路，判断条件变为是否比当前最小边要长，相当于青蛙跳那题反过来

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
const long long inf = 0x3f3f3f3f;
int n, m, vis[1005], T, g[1005][1005], d[1005];
int main()
{
	scanf("%d", &T);
	for (int t = 1; t <= T; t++) {
		memset(vis, 0, sizeof(vis));
		memset(g, 0, sizeof(g));
		scanf("%d%d", &n, &m);
		for (int i = 0; i < m; i++) {
			int x, y, d;
			scanf("%d%d%d", &x, &y, &d);
			g[x][y] = d;
			g[y][x] = g[x][y];
		}
		for (int i = 1; i <= n; i++)
			d[i] = g[1][i];
		while (true) {
			int k = -1;
			for (int i = 1; i <= n; i++)
				if (!vis[i] && (k == -1 || d[i] > d[k]))
					k = i;
			if (k == -1)
				break;
			vis[k] = 1;
			for (int i = 1; i <= n; i++) {
				d[i] = max(d[i], min(d[k], g[i][k]));
			}
		}
		printf("Scenario #%d:\n%d\n\n", t, d[n]);
	}
}