poj 1125 Stockbroker Grapevine(floyd)

#include <cstdio>
#include <cstring>
#define INF 999999
#define MAXN 110

int map[MAXN][MAXN];
int n;

void floyd()
{
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(map[i][j] > map[i][k] + map[k][j])
map[i][j] = map[i][k] + map[k][j];
int num;
int minute;
int res = INF;
for(int i = 1; i <= n; ++i)
{
minute = 0;
for(int j = 1; j <= n; ++j)
if(minute < map[i][j])
minute = map[i][j];
if(res > minute)
{
res = minute;
num = i;
}
}
if(res < INF)
printf("%d %d\n",num,res);
else
printf("disjoint\n");
}

int main()
{
int pair,minute,num;
while(scanf("%d",&n) && n)
{
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(i ==j) map[i][j] = 0;
else map[i][j] = INF;

for(int i = 1; i <= n; ++i)
{
scanf("%d",&pair);
for(int j = 0; j < pair; ++j)
{
scanf("%d %d",&num,&minute);
if(minute < map[i][num]) map[i][num] = minute;
}
}
floyd();
}
return 0;
}