POJ Stockbroker Grapevine（floyd）

 1 #include<iostream>
 2 #include<algorithm>
 3 #include<string>
 4 #include<cstring>
 5 using namespace std;
 6 
 7 const int maxn = 100 + 5;
 8 const int INF = 0x3f3f3f3f;
 9 
10 int n;
11 int d[maxn][maxn];
12 
13 
14 void floyd()
15 {
16     for (int k = 1; k <= n;k++)
17     for (int i = 1; i <= n;i++)
18     for (int j = 1; j <= n; j++)
19         d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
20 }
21 
22 int main()
23 {
24     //freopen("D:\\txt.txt", "r", stdin);
25     int x, a, t;
26     while (~scanf("%d", &n) && n)
27     {
28         for (int i = 1; i <= n; i++)
29         {
30             d[i][i] = 0;
31             for (int j = 1; j < i; j++)
32                 d[i][j] = d[j][i] = INF;
33         }
34 
35         for (int i = 1; i <= n; i++)
36         {
37             scanf("%d", &x);
38             while (x--)
39             {
40                 scanf("%d%d", &a, &t);
41                 d[i][a] = t;
42             }
43         }
44 
45         floyd();
46         int stock;
47         int ans = INF;
48         for (int i = 1; i <= n; i++)
49         {
50             int MAX = 0;
51             for (int j = 1; j <= n; j++)
52             {
53                 if (i == j) continue;
54                 MAX = max(MAX, d[i][j]);
55             }
56             if (ans > MAX)
57             {
58                 ans = MAX;
59                 stock = i;
60             }
61         }
62         if (ans == INF)
63             printf("disjoint\n");
64         else
65             printf("%d %d\n", stock, ans);
66     }
67     return 0;
68 }