zoj 1082 Stockbroker Grapevine
来源:互联网 发布:起点是网络出版社吗 编辑:程序博客网 时间:2024/04/28 19:41
//简单题,先用弗洛伊德算法求各个点最短路径,
每个点到其他点选取最大值,为最后传播的时间,
在求出其中最小的为开始散播的人速度最快的
#include<iostream>#include<cstring>#define MAX 100#define INF 100000 using namespace std; int map[MAX][MAX]; int n; int main() { int i,j,k; int num; int con,time; while(cin>>n,n) { memset(map,0,sizeof(map)); for(i=1; i<=n; i++) { cin>>num; while(num--) { cin>>con>>time; map[i][con]=time; } } for(i=1; i<=n; i++) for(j=1; j<=n; j++) if(i==j)map[i][j]=0; else if(map[i][j]==0)map[i][j]=INF; 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 maxtemp; int maxt=INF; int sp=1; for(i=1; i<=n; i++) { maxtemp=map[i][1]; for(j=2; j<=n; j++) { if(map[i][j]>maxtemp) { maxtemp=map[i][j]; } } if(maxt>maxtemp) { maxt=maxtemp,sp=i;} } if(maxt>=INF) cout<<"disjoint"<<endl; else cout<<sp<<" "<<maxt<<endl; } return 0; }
- ZOJ-1082 Stockbroker Grapevine
- zoj 1082 Stockbroker Grapevine
- zoj 1082 Stockbroker Grapevine
- zoj 1082 Stockbroker Grapevine
- ZOJ 1082 Stockbroker Grapevine
- ZOJ 1082 Stockbroker Grapevine (dijkstra方法)
- zoj 1082 Stockbroker Grapevine( 重写 SPFA!)
- ZOJ 1082 Stockbroker Grapevine【Bellman-Ford】
- zoj 1082 Stockbroker Grapevine 最短路 Dijkstra
- ZOJ Problem Set - 1082 Stockbroker Grapevine
- ZOJ 1082 Stockbroker Grapevine 最短路
- zoj 1082 Stockbroker Grapevine(最短路)
- ZOJ Problem Set - 1082 Stockbroker Grapevine
- ZOJ-1082-Stockbroker Grapevine(最短路径)
- zoj 1082 Stockbroker Grapevine(第一次写最短路径~~嘻嘻~)
- zoj 1082 && poj 1125 && 南阳oj 426 Stockbroker Grapevine
- stockbroker grapevine
- Stockbroker Grapevine
- Best Time to Buy and Sell Stock II
- java调用WCF问题
- hdu 1227 Fast Food(DP 类似最大m子段和)
- 由倒水问题引发出来的对于模线性方程与二元不定方程的思考
- 八皇后问题(C语言代码——小甲虫数据结构)
- zoj 1082 Stockbroker Grapevine
- 【转载】图数据库的选择
- boost swap
- C++ 应用程序性能优化
- boost optional
- 开发带属性的标签
- strcmp和strcpy
- [Chrome源码阅读] Browser相关的类
- hdu 1300 Pearls (DP 类似最长上升子序列)