题意:
求两个点之间经过的路径中最大噪声最小的值。
解析:
floyd的变式,每次取g[i][k] g[k][j]中的大边与当前边g[i][j]比较,取小。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long
using namespace std;
const int maxn = 100 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = 4 * atan(1.0);
const double ee = exp(1.0);
int c, s, q;
int g[maxn][maxn];
void floyd()
{
for (int k = 1; k <= c; k++)
{
for (int i = 1; i <= c; i++)
{
for (int j = 1; j <= c; j++)
{
g[i][j] = min(g[i][j], max(g[i][k], g[k][j]));
}
}
}
}
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
int ca = 1;
while (~scanf("%d%d%d", &c, &s, &q))
{
if (!c && !s && !q)
break;
memset(g, inf, sizeof(g));
for (int i = 0; i < s; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
g[u][v] = g[v][u] = w;
}
floyd();
if (ca != 1)
printf("\n");
printf("Case #%d\n", ca++);
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;
}