初级->图算法->最短路 poj 1125 Stockbroker Grapevine
来源:互联网 发布:生气 知乎 编辑:程序博客网 时间:2024/06/05 03:40
Stockbroker Grapevine
Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21767Accepted: 11857
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.
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.
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.
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
32 2 4 3 52 1 2 3 62 1 2 2 253 4 4 2 8 5 31 5 84 1 6 4 10 2 7 5 202 2 5 1 50
Sample Output
3 23 10
题意:有n个股票经纪人,股票经纪人要在一群人中散布一个传言,要求时间最短。第i个人向其他人散布传言的时间不同,但是,是同时传播的,也就是说取其最大值。
把每个人的传播时间的最大值求出来。然后取一个最小值,就是所求答案。
基本图算法 最短路问题。
floyd:
#include<stdio.h>#define MAX 101#define maxm 101int map[maxm][maxm],dist[maxm],d[maxm];int n,cou;int main(){int i,j,k,a,mit,minx,Max;while(scanf("%d",&n),n){for(i=1;i<=n;i++)for(j=1;j<=n;j++)if(i!=j)map[i][j]=MAX;else map[i][j]=0;for(i=1;i<=n;i++){scanf("%d",&cou);for(j=1;j<=cou;j++){scanf("%d%d",&a,&mit);if(mit<MAX)map[i][a]=mit;}}for(k=1;k<=n;k++)for(i=1;i<=n;i++){if(k==i) continue;for(j=1;j<=n;j++){if(k==j||i==j)continue;if(map[i][k]+map[k][j]<map[i][j])map[i][j]=map[i][k]+map[k][j];}}for(i=1;i<=n;i++){Max=map[i][1];for(j=1;j<=n;j++) if(Max<map[i][j]) Max=map[i][j];dist[i]=Max;}minx=dist[1];j=1;for(i=2;i<=n;i++)if(minx>dist[i])minx=dist[i],j=i; printf("%d %d\n",j,minx);}}
- 初级->图算法->最短路 poj 1125 Stockbroker Grapevine
- POJ Stockbroker Grapevine(最短路算法)
- POJ 1125 Stockbroker Grapevine 最短路folyd算法
- poj-1125-Stockbroker Grapevine(floyd算法最短路)
- POJ 1125 Stockbroker Grapevine 【最短路(Floyd算法)】
- POJ 1125 Stockbroker Grapevine (floyd算法,最短路)
- poj 1125 -- Stockbroker Grapevine (最短路)
- POJ 1125 Stockbroker Grapevine(最短路&Floyd)
- [poj 1125]Stockbroker Grapevine[Floyd最短路]
- POJ 1125 Stockbroker Grapevine (Floyd最短路)
- 【poj 1125】最短路---Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine [ 最短路]
- POJ 1125 Stockbroker Grapevine Floyd 最短路
- poj 1125 Stockbroker Grapevine 【最短路 Floyd】
- POJ 1125 Stockbroker Grapevine (最短路)
- POJ 1125Stockbroker Grapevine 【最短路】
- POJ 1125 Stockbroker Grapevine(最短路)
- POJ 1125 Stockbroker Grapevine 最短路
- mysql 1005-Can't create table ''error:121&mysql error 1005 can't create table'<errno:150>
- cat /proc/cpuinfo
- 显示或隐藏键盘改变tableView高度
- MongoDB学习笔记(五) MongoDB文件存取操作
- UML图之静态图
- 初级->图算法->最短路 poj 1125 Stockbroker Grapevine
- Flex中多线程的实现 ( 转 )
- 程序员面试题精选100题(47)-数组中出现次数超过一半的数字
- 开源SVM库libSVM介绍
- DOM 在js中的使用(2012.11.30)
- Hadoop学习笔记-Hadoop在Windows下安装
- C#入门经典(第五版)
- jquery对象和dom对象相互转换
- 经济管理、销售、人资