您的位置:首页 > 编程语言 > Go语言

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]);

#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;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: