POJ 1125 Stockbroker Grapevine

~~~题目链接~~~

题目大意：

思路：先用floyd求出任意两点间的最短距离， 在依次枚举每个点为起点的时间， 选时间最小的点

#include <stdio.h>
#include <string.h>
#define inf 100000000
using namespace std;
int n = 0, m = 0, map[102][102];
void floyd()
{
    int i = 0, j = 0, k = 0;
    for(k = 1; k<=n; k++)
        for(i = 1; i<=n; i++)
            for(j = 1; j<=n; j++)
                if(map[i][k]+map[k][j]<map[i][j])
                    map[i][j] = map[i][k]+map[k][j];
}


int main()
{
  //  freopen("input.txt", "r", stdin);
    int i = 0, j = 0, v = 0, s = 0, t = 0, ans = 0;
    while(scanf("%d", &n) , n)
    {
        for(i = 1; i<=n; i++)
            for(j = 1; j<=n; j++)
                map[i][j] = inf;

        for(i = 1; i<=n; i++)
        {
            scanf("%d", &m);
            for(j = 0; j<m; j++)
            {
                scanf("%d %d", &v, &t);
                map[i][v] = t;
            }
        }
        floyd();
        int max = 0, min = inf;
        for(i = 1; i<=n; i++)
        {
            max = -1;
            map[i][i] = 0;
            for(j = 1; j<=n; j++)//选出每组中最大的
                if(map[i][j]>max)
                    max = map[i][j];
            if(max<min)
            {
                min = max;
                s = i;
            }
        }
        if(min == inf) printf("disjoint\n");
        else printf("%d %d\n", s, min);
    }
    return 0;
}