//注意理解最坏情况的意义,floyd的初始化要注意i == j时!!!!
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn = 110;
const int inf = 0x3f3f3f3f;
int n;
int map[maxn][maxn], got[maxn][maxn];
int ans = inf, ans1, ans2;
void floyd(){
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
map[i][j] = map[j][i] = min(map[i][j], map[i][k]+map[k][j]);
}
int main(){
cin >> n;
int a, b, t;
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
if (i == j) map[i][j] = 0;//!!!!!!!!!!!
else map[i][j] = inf;
while(cin >> a >> b >> t){
map[a][b] = t;
map[b][a] = t;
}
floyd();
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++){
if(i == j) continue;
for(int k = 1; k <= n; k++)
got[i][j] = max(got[i][j], min(map[i][k], map[j][k]));
if(ans > got[i][j]){
ans = got[i][j];
ans1 = i;
ans2 = j;
}
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
CODEVS 1020 孪生蜘蛛
最新推荐文章于 2017-09-15 20:13:40 发布