poj1125 floyd解法
来源:互联网 发布:ubuntu软件安装位置 编辑:程序博客网 时间:2024/06/08 12:30
Stockbroker Grapevine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 37400 Accepted: 20793
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
Source
Southern African 2001
分析:最重要的是理解题意,然后在求出任意两点间最短路径的基础上,找到用时最少的那个出发点
ps:一开始做的时候把INF定义为1 << 30,结果memset的时候gg了.以后记住了,要么用fill,要么就把INF定义为0x3f3f3f3f.这个经典的赋值不是盖的
#include <cstdio>#include <cstdlib>#include <iostream>#include <stack>#include <queue>#include <algorithm>#include <cstring>#include <string>#include <cmath>#include <vector>#include <bitset>#include <list>#include <sstream>#include <set>#include <functional>using namespace std;#define INF 0x3f3f3f3f#define MAX 100typedef long long ll;int n,m;int d[110][110];void floyd(){ for (int k = 1; k <= n; k += 1){ for (int i = 1; i <= n; i += 1){ for (int j = 1; j <= n; j += 1){ d[i][j] = min(d[i][j],d[i][k]+d[k][j]); } } } int minans = INF; int maxans,start; for (int i = 1; i <= n; i += 1){ maxans = 0; for (int j = 1; j <= n; j += 1){ if(i != j) maxans = max(maxans,d[i][j]); } if(minans > maxans){ minans = maxans; start = i; } } cout << start << " " << minans << endl;}int main(){ while (cin >> n,n){ memset(d,INF,sizeof(d)); for (int i = 1; i <= n; i += 1){ cin >> m; for (int j = 1; j <= m; j += 1){ int k; cin >> k ; cin >> d[i][k]; } } floyd(); } return 0;}
- poj1125 floyd解法
- poj1125(Floyd)
- POJ1125-Floyd
- poj1125 (Floyd)
- POJ1125 Floyd
- poj1125--Floyd
- poj1125 floyd
- poj1125 floyd
- poj1125 floyd
- poj1125 (floyd)
- poj1125 floyd
- POJ1125 Floyd
- poj1125 Floyd-Warshall算法
- poj1125 最短路floyd
- poj1125(floyd最短路)
- poj1125 Floyd算法
- POJ1125(Floyd算法)
- poj1125之floyd
- Spring Boot -- Spring Data Jpa(1)
- windows 安装oracle 11
- 3.1 类的声明与对象的定义【C++】
- oracle解锁用户
- Unity3d笔记1-XML的读取和存储
- poj1125 floyd解法
- jq代码学习19----- jq中的ajax全局事件
- JAVA日志
- 形形色色的水果姐逛水果街——codevs水果姐逛水果街1-3:线段树与ST表
- 重写equals()方法就必须重写hashCode()方法的原因
- dialog的使用,按钮的两种实现方式
- erlang简易聊天室基于OTP(gen_server,gen_fsm)
- CHAIN OF RESPONSIBILITY 职责链模式 --对象行为型模式
- System.arraycopy实现数组之间的复制