POJ 1125 Stockbroker Grapevine
来源:互联网 发布:网络链接推广 编辑:程序博客网 时间:2024/06/07 14:10
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22127 Accepted: 12069
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
------------------------------------------------------------------------------
这绝对是英语题。
给你一张图,问以哪个点为起点可以有最短的时间。
最短时间为该点到最远点所用的时间。
用弗洛伊德算法求出所有点到所有点的最短路,然后找出时间最短的起点。
#include <iostream>#define OO 999999using namespace std;int a[200][200];int n;int main(){ int x,y,t; int ans,max,min; while (cin>>n) { if (n==0) break; for (int i=0;i<=n;i++) { for (int j=0;j<=n;j++) { a[i][j]=OO; } } for (int i=1;i<=n;i++) { cin>>x; for (int j=1;j<=x;j++) { cin>>y>>t; a[i][y]=t; } } for (int k=1;k<=n;k++) { for (int i=1;i<=n;i++) { for (int j=1;j<=n;j++) { if (a[i][k]+a[k][j]<a[i][j]) { a[i][j]=a[i][k]+a[k][j]; } } } } min=OO; for (int i=1;i<=n;i++) { max=-OO; for (int j=1;j<=n;j++) { if (i!=j&&a[i][j]>max) { max=a[i][j]; } } if (max<min) { min=max; ans=i; } } cout<<ans<<" "<<min<<endl; } return 0;}
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- Poj 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- poj 1125-Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- poj 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- POJ 1125 Stockbroker Grapevine
- suse日志服务器配置
- DOS操作系统中的内存管理
- linux crontab 命令的用法
- /var/log目录下的20个Linux日志文件功能详解
- 5 个开源 3D 建模/渲染工具
- POJ 1125 Stockbroker Grapevine
- 寒假刷题之4——机械化表面?
- Myeclipse 9.1 、10通过注册机破解全过程
- SNMPv3基于用户的安全模型USM(2)
- Android ListView从网络获取图片及文字显示
- C++ 类对象和 指针的区别
- 线程池 AsynLogon的队列已达到最大作业容量50
- GraphicsUtilities,找你好苦
- 蒙特卡罗算法的matlab实现