大体题意:
给你C个点 和S条边,边权威噪音值,当噪音值太大时,耳膜会受到损害! 给你一列询问,每个询问 包括u 和 v,问从u 到 v 最大噪音值 最小值是多少!
思路:
Floyd 求任意两点最短路,有些不同,
正常的Floyd 时 g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
这里应该为
g[i][j] = min(g[i][j],max(g[i][k],g[k][j]));
先取得一个最大噪音值,在与本身最小化!
#include<cstdio>
#include<cstring>
#include<algorithm>
#define frin freopen("cin.txt","r",stdin);
#define frout freopen("out.txt","w",stdout);
using namespace std;
const int maxn = 100 + 5;
const int INF = 1000000 + 1;
int g[maxn][maxn];
int main(){
// frin;
// frout;
int n,m,q,cnt=0;
while(scanf("%d%d%d",&n,&m,&q) == 3 && (n || m || q)){
for (int i = 0; i < maxn; ++i)
for (int j = 0; j < maxn; ++j)
g[i][j] = ((i == j) ? 0 : INF);
for (int i = 0; i < m; ++i){
int u,v,k;
scanf("%d%d%d",&u,&v,&k);
g[u][v] = min(g[u][v],k);
g[v][u] = g[u][v];
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
g[i][j] = min(g[i][j],max(g[i][k],g[k][j]));
if (cnt++)printf("\n");
printf("Case #%d\n",cnt);
for (int i = 0; i < q; ++i){
int u,v;
scanf("%d%d",&u,&v);
if (g[u][v] >= INF)printf("no path\n");
else printf("%d\n",g[u][v]);
}
}
return 0;
}