POJ 1125 Stockbroker Grapevine Floyd 最短路

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <cstring>

#define INF 100000000
using namespace std;
int n;
int a[105][105];
int ans[105];

int main(){
	while(cin >> n,n){
		for(int i  = 1;i <= n;i++){
			for(int j = 1;j <= n;j++){
				a[i][j] = INF;
			}
		}
		int m;

		for(int i = 1;i <= n;i++){
			scanf("%d",&m);

			for(int j = 1;j <= m;j++){
				int x,v;
				scanf("%d%d",&x,&v);
				a[i][x] = v;
			}
		}

		for(int k = 1;k <= n;k++){
			for(int i = 1;i <= n;i++){
				for(int j = 1;j <= n;j++){
					a[i][j] = min(a[i][j],a[i][k]+a[k][j]);
				}
			}
		}
		int max = INF;
		int maxn;

		for(int i = 1;i <= n;i++){
			ans[i] = 0;

			for(int j = 1; j <= n;j++){
				if(i != j && a[i][j] > ans[i]){
					ans[i] = a[i][j];

				}
			}
			if(ans[i] < max){
				max = ans[i];
				maxn = i;
			}
		}
		if(max >= INF){
			cout << "disjoint" << endl;
		}
		else{
			printf("%d %d\n",maxn,max);
		}
	}
	return 0;
}

时间: 2024-11-05 19:41:14

POJ 1125 Stockbroker Grapevine Floyd 最短路的相关文章

POJ 1125 Stockbroker Grapevine (Floyd算法)

Floyd算法计算每对顶点之间的最短路径的问题 题目中隐含了一个条件是一个人可以同时将谣言传递给多个人 题目最终的要求是时间最短,那么就要遍历一遍求出每个点作为源点时,最长的最短路径长是多少,再求这些值当中最小的是多少,就是题目所求 #include<bits/stdc++.h> using namespace std; int n,x,p,t; int m[120][120],dist[120][120],Max[120]; void floyd(int n,int m[][120],int

poj 1125 Stockbroker Grapevine -- floyd 全源最短路

Stockbroker Grapevine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33164   Accepted: 18259 Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst th

poj 1125 Stockbroker Grapevine(多源最短路)

链接:poj 1125 题意:输入n个经纪人,以及他们之间传播谣言所需的时间, 问从哪个人开始传播使得所有人知道所需时间最少,这个最少时间是多少 分析:因为谣言传播是同时的,对于某条路径使得所有人都知道的时间,不是时间的总和,而是路径中最长的边 从多条路径的最长边,找出最小值,因为为多源最短路,用Floyd比较方便 #include<stdio.h> #include<limits.h> int a[105][105]; void floyd(int n) { int i,j,k,

poj 1125 Stockbroker Grapevine(多源最短)

id=1125">链接:poj 1125 题意:输入n个经纪人,以及他们之间传播谣言所需的时间, 问从哪个人開始传播使得全部人知道所需时间最少.这个最少时间是多少 分析:由于谣言传播是同一时候的,对于某条路径使得全部人都知道的时间.不是时间的总和,而是路径中最长的边 从多条路径的最长边,找出最小值.由于为多源最短路,用Floyd比較方便 #include<stdio.h> #include<limits.h> int a[105][105]; void floyd(

POJ 1125 Stockbroker Grapevine

Stockbroker Grapevine Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 33141   Accepted: 18246 Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst th

POJ 1125 Stockbroker Grapevine (动规)

Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26392 Accepted: 14555 Description Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the st

POJ - 1125 Stockbroker Grapevine (动态规划理解floyd)

题目大意:有一个,想要在最短的时间內将一个谣言散发给所有人,但是他只能将这个谣言告诉给一个人,然后通过这个人传播出去.问,他应该告诉哪个人,让所有人都听到这个谣言的最短时间是多少 解题思路:这题很容易想到用floyd求出每个点之间的最短路. 做这题时,已经很久没做最短路的了,所以一时写不出floyd.发现自己太依赖模版了,所以在这里想写一下自己对floyd的理解(借鉴了这里写链接内容)好让自己下次不看模版也能想出来 设dp[i][j]为i到j的最短路,因为floyd有三成for,写起来的时候也知

POJ 1125 Stockbroker Grapevine【floyd】

很裸的floyd #include<cstdio> #include<string.h> #include<algorithm> #define maxn 201 #define inf 100000 using namespace std; int map[maxn][maxn],n,x,y,m;; int main() { while(1) { scanf("%d",&n); if(n==0)break; for(int i=1;i<

poj 1125 Stockbroker Grapevine(最短路径)

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