http://poj.org/problem?id=1125

Description

Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock market. For maximum effect, you have to spread the rumours in the fastest possible way.

Unfortunately for you, stockbrokers only trust information coming from their "Trusted sources" This means you have to take into account the structure of their contacts when starting a rumour. It takes a certain amount of time for a specific stockbroker to pass the rumour on to each of his colleagues. Your task will be to write a program that tells you which stockbroker to choose as your starting point for the rumour, as well as the time it will take for the rumour to spread throughout the stockbroker community. This duration is measured as the time needed for the last person to receive the information.
Input

Your program will input data for different sets of stockbrokers. Each set starts with a line with the number of stockbrokers. Following this is a line for each stockbroker which contains the number of people who they have contact with, who these people are, and the time taken for them to pass the message to each person. The format of each stockbroker line is as follows: The line starts with the number of contacts (n), followed by n pairs of integers, one pair for each contact. Each pair lists first a number referring to the contact (e.g. a '1' means person number one in the set), followed by the time in minutes taken to pass a message to that person. There are no special punctuation symbols or spacing rules.

Each person is numbered 1 through to the number of stockbrokers. The time taken to pass the message on will be between 1 and 10 minutes (inclusive), and the number of contacts will range between 0 and one less than the number of stockbrokers. The number of stockbrokers will range from 1 to 100. The input is terminated by a set of stockbrokers containing 0 (zero) people.


Output

For each set of data, your program must output a single line containing the person who results in the fastest message transmission, and how long before the last person will receive any given message after you give it to this person, measured in integer minutes.
It is possible that your program will receive a network of connections that excludes some persons, i.e. some people may be unreachable. If your program detects such a broken network, simply output the message "disjoint". Note that the time taken to pass the message from person A to person B is not necessarily the same as the time taken to pass it from B to A, if such transmission is possible at all.
Sample Input

3
2 2 4 3 5
2 1 2 3 6
2 1 2 2 2
5
3 4 4 2 8 5 3
1 5 8
4 1 6 4 10 2 7 5 2
0
2 2 5 1 5
0
Sample Output

3 2
3 10
说起这题气不打一出来，，，，昨天月赛时是看不懂题，以至于不知怎样建图，，，结果悲剧了，今天在网上搜了一下题意，原来就是求源点和以每个点为源点时，最大值中的最小的哪一个，，，然后立即果断写出代码，但在我们oj上一次一次的RTE，bj啊！！我对我自己很是无语了，，，，最后实在木办法，就去poj提交了一次，结果果断AC而且代码还挺优，坑爹啊，，，不得不让我对我们oj的质量产生怀疑了，纠结。。。
AC代码：

#include<iostream>
#include<string.h>
#define N 105
#define M 99999999
#define FOR(i,s,t) for(int i=(s);i<=(t);++i)
using namespace std;
int n;
int map[N][N];
int dist[N];
bool visit[N];
int main()
{ while(cin>>n,n)
{ memset(map,0,sizeof(map));
FOR(i,1,n)
{ int m;
cin>>m;
if(!m) continue;
FOR(j,1,m)
{ int a,b;
cin>>a>>b;
map[i][a]=b;
}
}
int mmin=M,mink;
FOR(i,1,n)
{ int now=i;
bool bb=true;
FOR(j,1,n)
{ dist[j]=M;
visit[j]=true;
}
dist[now]=0;
visit[now]=false;
FOR(k,1,n)
{ int minx=M;
FOR(j,1,n)
if(visit[j]&&map[now][j]&&dist[j]>dist[now]+map[now][j])//注意建的该图为单向图，，
dist[j]=dist[now]+map[now][j];
FOR(j,1,n)
if(visit[j]&&minx>dist[j])
minx=dist[now=j];
visit[now]=false;
}
int _max=0;
FOR(p,1,n)
if(dist[p]==M)
{bb=false;break;}
if(bb)
{ FOR(p,1,n)
if(dist[p]>_max) _max=dist[p];
if(mmin>_max) mmin=_max,mink=i;
}

}
if(mmin<M&&mmin!=0) cout<<mink<<" "<<mmin<<endl;
else cout<<"disjoint"<<endl;

} return 0;
}