poj1125——Stockbroker Grapevine（floyd算法）

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

题意比较难懂，我看了好几遍才知道意思。大意是要在一个人群网络里传播谣言，求最短时间可以传播完毕的那个人和最短时间。输入的第一行是人数n，标号1~n，接下来n行表示第n的人可以联系的人与需要的时间，第一个数m表示第n个人可以联系的人，然后是m对数表示可联系的人的标号和需要的时间

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <iostream>
using namespace std;
const int inf = 1<<20;
const int MAXN= 105;
int n,m;
int map[MAXN][MAXN];
void Floyd()
{
    int i,j,k;
    for(k=1; k<=n; k++)
        for(i=1; i<=n; i++)
            for(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 main()
{
    int i,j,p,t,w;
    while(~scanf("%d",&n)&&n)
    {
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                map[i][j]=(i==j?0:inf); //注意自身和自身距离为0。
        for(i=1; i<=n; i++)
        {
            scanf("%d",&m);
            while(m--)
            {
                scanf("%d%d",&p,&t);
                if(map[i][p]>t)
                    map[i][p]=t;
            }
        }
        Floyd();
        bool flag=false;
        int min=inf,mi,max=-inf;
        for(i=1; i<=n; ++i)
        {
            max=-inf;
            for(j=1; j<=n; ++j)
            {
                if(map[i][j]!=inf)
                {
                    flag=true;
                }
                else
                    flag=false;
                if(map[i][j]>max&&i!=j)
                    max=map[i][j];
            }
            if(max<min)
            {
                min=max;
                mi=i;
            }
        }
        if(flag)
            printf("%d %d\n",mi,min);
        else
            printf("disjoin\n");
    }
    return 0;
}