POJ 1125 Stockbroker Grapevine
来源:互联网 发布:linux tar 压缩文件夹 编辑:程序博客网 时间:2024/06/09 21:30
题目链接:点击打开链接
题目大意:一张有向图,100个点,从哪个点开始出发,到达其他点的最大距离最小。
方法就是floyd处理出两点间距离,然后再枚举出答案。
#include <iostream>#include <cstdio>#include <cstring>#include <vector>#include <algorithm>using namespace std;#define INF 0x3f3f3f3fint dis[105][105];int main(){ int n,x,v,t,ans,tmp,p; while(scanf("%d",&n),n){ memset(dis,INF,sizeof(dis)); for(int i = 1;i <= n;i++){ dis[i][i] = 0; } for(int i = 1;i <= n; i++){ cin>>x; for(int j = 0; j < x; j++){ cin>>v>>t; dis[i][v] = t; } } for(int k = 1;k <= n;k++){ for(int i = 1;i <= n;i++){ for(int j = 1;j <= n;j++ ){ if(dis[i][j] > dis[i][k] + dis[k][j]) dis[i][j] = dis[i][k] + dis[k][j]; } } } ans = INF + 1; for(int i = 1;i <= n;i++){ tmp = 0; for(int j = 1; j <= n;j++) tmp = max(tmp,dis[i][j]); if(ans > tmp){ ans = tmp; p = i; } } printf("%d %d\n",p,ans); } return 0;}
0 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
- 网络加载图片时显示错位的解决方法
- [Errno 14] problem making ssl connection问题解决
- iOS Category与Extension、Delegate的认识
- centos codeblocks 安装
- Bootstrap 定制和修改方法-perfect
- POJ 1125 Stockbroker Grapevine
- 对UE4动画通知的理解
- (4.1.8.6)Android项目Tab类型主界面大总结 Fragment+TabPageIndicator+ViewPager
- 如何update自己fork别人的代码
- mono for android开发1
- Android中pendingIntent的举例
- 安卓基础(十三)
- C# 遍历treeview
- sql server 获取当前时间