uva 10048(最短路径)
2014-11-05 11:14
239 查看
题意:给出n个城镇,m条路径,路径上会有噪音,给出起点和终点,问从起点到终点的所有路径中受到的噪音最大值最小的数。
题解:floyd算法,只要比较两条路径得到噪音的较大的选出最小的赋给g[i][j],输出g[sta][end]。
题解:floyd算法,只要比较两条路径得到噪音的较大的选出最小的赋给g[i][j],输出g[sta][end]。
#include <stdio.h> #include <string.h> const int INF = 0x3f3f3f3f; const int N = 105; int g , t = 1, que, n, m; void floyd() { for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) { int maxx = g[i][k] < g[k][j] ? g[j][k] : g[i][k]; if (g[i][j] > maxx) g[i][j] = maxx; } } int main() { while (scanf("%d%d%d", &n, &m, &que) && n || m || que) { memset(g, INF, sizeof(g)); int a, b, c; for (int i = 0; i < m; i++) { scanf("%d%d%d", &a, &b, &c); g[a][b] = g[b][a] = c; } floyd(); int sta, end; if (t != 1) printf("\n"); printf("Case #%d\n", t++); while (que--) { scanf("%d%d", &sta, &end); if (g[sta][end] < INF) printf("%d\n", g[sta][end]); else printf("no path\n"); } } return 0; }
相关文章推荐
- UVA10048 Floyd最短路径
- UVA - 216 Getting in Line (求最短路径)
- uva 10099(最短路径)
- uva 11478 最短路径问题(负环,差分约束系统)
- uva10986 堆优化单源最短路径(pas)
- uva 558(最短路径)
- uva 10985(最短路径)
- uva 563 Crimewave 最短路径
- uva 1416 Warfare And Logistics (最短路径树)
- 11.3.4-uva10048-floyd变形-两点之间路径上最大边的最小值
- uva 11374 Dijkstra (单源最短路径)
- POJ-2662-A Walk Through the Forest;UVA-10917 - Walk Through the Forest(最短路径)
- POJ 1511 Invitation Cards / UVA 721 Invitation Cards / SPOJ Invitation / UVAlive Invitation Cards / SCU 1132 Invitation Cards / ZOJ 2008 Invitation Cards / HDU 1535 (图论,最短路径)
- UVa10246 - Asterix and Obelix(最短路径变形)
- POJ 1502 MPI Maelstrom / UVA 432 MPI Maelstrom / SCU 1068 MPI Maelstrom / UVALive 5398 MPI Maelstrom /ZOJ 1291 MPI Maelstrom (最短路径)
- uva117 最短路径
- uva 10269(最短路径)
- The Postal Worker Rings Once(UVA 117)最短路径—SPFA算法+邻接表
- UVA 11883 Repairing a Road(最短路径+暴力枚举)
- uva 10801(最短路径)