C++ P0003 服务点设置

# include <iostream>
# include <cstdio>
using namespace std;
const int maxn = 0x7fffffff/3;
int map[110][110], n, m, u, v, t, minx = maxn, mins, cost;
int main() {
//	freopen("djsa.in", "r", stdin);
//	freopen("djsa.out", "w", stdout);
cin >> n >> m;
for(int i = 0; i < n; i++) // 初始化无穷大
for(int j = 0; j < n; j++)
map[i][j] = maxn;
for(int i = 1; i <= m; i++) {
cin >> u >> v >> t;
map[u][v] = map[v][u] = t; // 双向边
}
for(int i = 0; i < n; i++) // Floyd
for(int j = 0; j < n; j++)
for(int z = 0; z < n; z++)
map[j][z] = min(map[j][z], map[j][i] + map[i][z]);
for(int i = 0; i < n; i++){
mins = 0; // i点到它其它点最短路中最大的边权
for(int j = 0; j < n; j++)
if(j != i) mins = max(mins, map[i][j]); // 更新mins
// minx 图中最短路最小边权
if(minx > mins) { // 如果有mins会更小，那么记录下来，在更新minx
cost = i; minx = mins;
}
}
cout << cost;
return 0;
}