题意:
在所有s到t的路径中,设路径中最短的一步为d,使d尽量大
思路:
每次找最长的一步d,更新ans = min(ans, d),将点纳入集合(集合中相互距离为0),并向外扩展,循环最多n-1次,一定能找到目标。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 1000+5;
using namespace std;
int n,m;
int G[maxn][maxn], d[maxn];
bool vis[maxn];
int main()
{
//freopen("in.txt","r",stdin);
int T; scanf("%d",&T);
int kase = 1;
while(T--){
memset(vis, 0, sizeof(vis));
memset(G, 0, sizeof(G));
scanf("%d%d",&n,&m);
for(int i = 0; i < m; ++i){
int a,b,c; scanf("%d%d%d",&a,&b,&c);
G[a][b] = G[b][a] = c;
}
for(int i = 1; i <= n; ++i) d[i] = G[1][i];
d[1] = 0;
vis[1] = 1;
int ans = INF;
for(int i = 2; i <= n; ++i){
int x = 1, m = 0;
for(int j = 1; j <= n; ++j) if(!vis[j]&&d[j] > m) m = d[x = j];
if(ans > m) ans = m;
if(x == n) break;
vis[x] = 1;
for(int j = 1; j <= n; ++j) if(!vis[j]) d[j] = max(d[j], G[x][j]);
}
printf("Scenario #%d:\n%d\n",kase++,ans);
printf("\n");
}
fclose(stdin);
return 0;
}