POJ 1125 Stockbroker Grapevine

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
思路：
有向图的最短路径问题，使用Floyd算法。对于每一个起点位置，计算到达所有节点的最大时间， 最终结果为到达所有节点时间最短的起点。如果最短时间为inf, 则说明不连通。
代码如下：

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<memory.h>
#include<limits.h>
using namespace std;

int G[105][105];

int main() {
   // freopen("input.txt","r",stdin);
    int n;
    while(cin>>n) {
        if(0 == n) break;
        for(int i = 0; i < 105; i++) {
            for(int j = 0; j < 105; j++) {
                if(i == j) G[i][j] = 0;
                else G[i][j] = INT_MAX;
            }
        }
        for(int i  = 1; i <= n; i++) {
            int m; cin>>m;
            for(int j = 1; j <= m; j++) {
                int p,t; cin>>p>>t;
                G[i][p] = t;
            }
        }
        for(int k = 1; k <= n; k++) {
            for(int i = 1; i <= n; i++) {
                for(int j = 1; j <= n; j++) {
                    if(G[i][k] != INT_MAX && G[k][j] != INT_MAX) { //直接相加求和，有可能会发生上溢
                        if(G[i][j] > G[i][k] + G[k][j]) {
                            G[i][j] = G[i][k] + G[k][j];
                        }
                    }
                }
            }
        }
        int res = 0, minT = INT_MAX;
        for(int i = 1; i <= n; i++) {
            int tmpT = 0;
            for(int j = 1; j <= n; j++) {
                if(tmpT < G[i][j]) tmpT = G[i][j];
            }
            if(tmpT < minT) {
                minT = tmpT;
                res = i;
            }
        }
        if(minT == INT_MAX) cout<<"disjoint"<<endl;
        else cout<<res<<" "<<minT<<endl;
    }
    return 0;
}