poj1125 floyd
来源:互联网 发布:java公司官网模板源码 编辑:程序博客网 时间:2024/04/29 04:17
如题:http://poj.org/problem?id=1125
Description
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
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
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
Source
题目大意:求出所给有向图某一点到其他所有点所花费的时间中最大的那一个最小。
思路:floyd水过
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
#define MAXN 105
#define INF 0x0fffffff
int n,m;
int map[MAXN][MAXN];
int main()
{
// freopen("C:\\1.txt","r",stdin);
while(~scanf("%d",&n))
{
if(!n)
break;
int i,j,k;
for(i=0;i<MAXN;i++)
for(j=0;j<MAXN;j++)
map[i][j]=INF;
for(i=1;i<=n;i++)
map[i][i]=0;
for(i=1;i<=n;i++)
{
scanf("%d",&m);
for(j=0;j<m;j++)
{
int v,cost;
scanf("%d%d",&v,&cost);
map[i][v]=cost;
}
}
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 d[MAXN]={0};
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(map[i][j]>d[i])
d[i]=map[i][j];
int v,min=INF;
for(i=1;i<=n;i++)
if(min>d[i])
{
min=d[i];
v=i;
}
if(min==INF)
printf("disjoint\n");
else
printf("%d %d\n",v,min);
}
}
- 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
- poj1125--floyd算法
- Sicily 1889. Max’s game
- Ajax原理
- 第四届蓝桥杯预赛:第39台阶
- 新手如何使用eclipse编写Java(一)
- Sicily 1135. 飞越原野
- poj1125 floyd
- Sicily 1090. Highways
- cocos3——9.AssetsManager动态更新配置文件详解
- Sicily 1133. SPAM
- java 面试的体验
- hdu 3152Obstacle Course bfs+优先队列
- xcode快捷键
- Hdu 5192 Building Blocks Ⅱ
- 力所能及之Java反射机制(模拟EL表达式)