106 miles to Chicago---zoj2797（最短路问题，求概率，模板）

#include <stdio.h>
#include <algorithm>
#include<string.h>
#include<queue>
using namespace std;

#define met(a, b) memset(a, b, sizeof(a))
#define MOD 1000000007
#define N 2050
#define INF 0x3f3f3f3f

typedef long long LL;

int n, m, G

, vis
;

double dist
;

double Dijkstra(int s)
{
for(int i=1; i<=n; i++)
dist[i] = G[s][i];

vis[s] = 1;

for(int i=1; i<=n; i++)
{
double Min = -INF;
int Index = -1;

for(int j=1; j<=n; j++)
{
if( !vis[j] && Min < dist[j])
{
Min = dist[j];
Index = j;
}
}
if(Index == -1)break;

vis[Index] = 1;

for(int j=1; j<=n; j++)
{
if( !vis[j] && dist[j] < dist[Index]*G[Index][j]/100.0)
{
dist[j] = dist[Index]*G[Index][j]/100.0;
}
}
}
return dist
;
}

void Init()
{
for(int i=0; i<=n; i++)
{
for(int j=0; j<=n; j++)
G[i][j] = -INF;
dist[i] = -INF;
G[i][i] = vis[i] = 0;
}
}

int main()
{
int a, b, c;
while(scanf("%d", &n), n)
{
Init();

scanf("%d", &m);

for(int i=1; i<=m; i++)
{
scanf("%d%d%d", &a, &b, &c);
G[a][b] = G[b][a] = max(G[a][b], c);
}

double ans = Dijkstra(1);

printf("%.6f percent\n", ans);
}
return 0;
}