UVA - 10048 Audiophobia
2014-12-13 16:15
330 查看
题目大意:有n个城市,和m条街道,每条街道有一个噪音值,q次去问,从城市a到城市b,路径上分贝值的最大值最小为多少
解题思路:Floyd变形
解题思路:Floyd变形
#include <cstdio> #include <algorithm> using namespace std; int main() { int C, S, Q, cnt = 0, d[110][110]; while (scanf("%d%d%d", &C, &S, &Q), C) { for (int i = 1; i <= C; i++) for (int j = 1; j <= C; j++) d[i][j] = 0x3f3f3f3f; int x, y, D; for (int i = 0; i < S; i++) { scanf("%d%d%d", &x, &y, &D); d[x][y] = d[y][x] = D; } for (int k = 1; k <= C; k++) for (int i = 1; i <= C; i++) for (int j = 1; j <= C; j++) d[i][j] = min(d[i][j], max(d[i][k], d[k][j])); printf("%sCase #%d\n", cnt++ ? "\n" : "", cnt); for (int i = 0; i < Q; i++) { scanf("%d%d", &x, &y); printf(d[x][y] < 0x3f3f3f3f ? "%d\n" : "no path\n", d[x][y]); } } return 0; }
相关文章推荐
- UVa 10048 Audiophobia 最短路的最大值
- UVA10048 Audiophobia[Floyd变形]
- UVA10048-Audiophobia-最短路
- UVa:10048 Audiophobia
- UVa10048_Audiophobia(最短路/floyd)(小白书图论专题)
- UVa 10048 - Audiophobia 简单Floyd
- uva 10048 - Audiophobia
- UVa 10048 Audiophobia(最短路&Floyd)
- UVA 10048 Audiophobia 最小生成树
- 例题11-5 UVA - 10048 Audiophobia 噪音恐惧症(Floyd算法)
- UVa10048 Audiophobia (Floyd)
- uva10048 - Audiophobia
- UVA 10048 Audiophobia
- uva 10048 Audiophobia
- UVA 10048 Audiophobia
- uva 10048 Audiophobia(最小生成树)
- uva 10048 Audiophobia(最小生成树)
- UVa 10048: Audiophobia
- UVa 10048: Audiophobia
- UVA10048-Audiophobia