pku1125 Stockbroker Grapevine
2013-05-24 15:14
211 查看
http://poj.org/problem?id=1125
最短路,floyd
最短路,floyd
#include <stdio.h> #include <string.h> #define N 123 int n, g ; const int inf = 123456; int min(int x, int y) { return x<y? x: y; } void floyd() { int i, j, k; for(k=1; k<=n; k++) { for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { g[i][j] = min(g[i][j], g[i][k]+g[k][j]); } } } } int main() { int t, m, i, j, x, y, len; int max1, result, flag; while(scanf("%d", &n), n) { for(i=1; i<=n; i++) { for(j=1; j<=n; j++) { g[i][j] = inf; } } for(i=1; i<=n; i++) { scanf("%d", &m); for(j=1; j<=m; j++) { scanf("%d%d", &x, &len); g[i][x] = len; } } floyd(); result = inf; flag = 1; for(i=1; i<=n; i++) { max1 = 0; for(j=1; j<=n; j++) { if(i != j) { if(g[i][j] > max1) { max1 = g[i][j]; } } } if(max1 < result) { result = max1; flag = i; } } if(result == inf) { printf("disjoint\n"); } else { printf("%d %d\n", flag, result); } } return 0; }
相关文章推荐
- Pku acm 1125 Stockbroker Grapevine 动态规划题目解题报告(十九)
- pku 1125—Stockbroker Grapevine
- (最短路-floyd+邻接矩阵)PKU-1125 Stockbroker Grapevine
- pku 1125 Stockbroker Grapevine(Floyd-Warshall)
- pku1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine 【最短路 Floyd】
- POJ 1125 Stockbroker Grapevine
- POJ-1125 Stockbroker Grapevine (floyd)
- POJ 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine(floyd)
- POJ 1125 Stockbroker Grapevine(Floyd算法)
- POJ - 1125 Stockbroker Grapevine(Java)
- poj 1125 Stockbroker Grapevine
- Stockbroker Grapevine--POJ 1125
- poj 1125(Stockbroker Grapevine)Dijkstra算法
- ACM学习-POJ-1125-Stockbroker Grapevine
- poj1125 POJ 1125 Stockbroker Grapevine(两种方法Dijkstra或者floyd)
- POJ1125 Stockbroker Grapevine 【Floyd】
- POJ1125 Stockbroker Grapevine【Floyd】
- poj 动态规划DP - 1125 Stockbroker Grapevine