ZOJ 2797 POJ 2472 106 miles to Chicago
2013-09-03 16:25
393 查看
Floyd递推方程
dist[i][j] = max(dis[i][j], dist[i][k]*dist[k][j]);
dist[i][j] = max(dis[i][j], dist[i][k]*dist[k][j]);
#include <iostream> #include <cstring> #include <iomanip> using namespace std; #define MAX(a, b) (a > b ? a : b) const int MAXN = 1010; double dist[MAXN][MAXN]; int n, m; void Floyd() { int i, j, k; for(k = 1; k <= n; ++k) { for(i = 1; i <= n; ++i) { for(j = 1; j <= n; ++j) dist[i][j] = MAX(dist[i][j], dist[i][k] * dist[k][j]); } } } int main() { int i, j; int a, b, p; while( cin>>n ) { if(n == 0) break; cin>>m; for(i = 0; i <= n; ++i) for(j = 0; j <= n; ++j) { if(i == j) dist[i][j] = 1; else dist[i][j] = 0; } for(i = 1; i <= m; ++i) { cin>>a>>b>>p; dist[a][b] = dist[b][a] = ( double) p/100 ; } Floyd(); cout << fixed << setprecision(6) << dist[1] *100<<" percent"<<endl; } return 0; }
相关文章推荐
- POJ 2472 &&ZOJ 2797 (106 miles to Chicago)
- zoj 2792 && poj 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ:2472 106 miles to Chicago
- poj 2472 106 miles to Chicago
- POJ 2472 106 miles to Chicago
- (floyed反求最长路径)ZOJ 2797 106 miles to Chicago
- poj 2472 106 miles to Chicago
- poj 2472 106 miles to Chicago floyd
- Poj 2472 106 miles to Chicago【Floyd】
- poj 2472 106 miles to Chicago
- POJ-2472 106 miles to Chicago
- 【POJ】2472 106 miles to Chicago 最短路
- poj 2472 106 miles to Chicago a->b有安全概率,求i->j安全概率最大的一条路
- POJ 2472 106 miles to Chicago(最短路)
- zoj - 2797 - 106 miles to Chicago