HDU 1596 find the safest road



http://acm.hdu.edu.cn/showproblem.php?pid=1596

最短路问题的变形 使用迪杰斯特拉单源最短路算法

AC_CODE:

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAX = 1010;

int N,E,vis[MAX];
double G[MAX][MAX],safe[MAX];

void dijkstra(int scr){
    for(int i=1; i<=N; i++){
        safe[i] = G[scr][i];
        vis[i] = 0;
    }
    vis[scr] = 1;
    for(int i=0; i<N-1; i++){
        double tmp = 0.000;
        int k =scr;
        for(int j=1; j<=N; j++){
            if(vis[j])  continue;
            if(safe[j] > tmp){
                tmp = safe[j];
                k = j;
            }
        }
//        cout << tmp << endl;
        vis[k] = 1;
        for(int j=1; j<=N; j++){
            if(vis[j])  continue;
            safe[j] = max(safe[j], safe[k] * G[k][j]);
        }
    }
}
int main(){
//    freopen("in.txt", "r", stdin);
    while(scanf("%d",&N) != EOF){
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++)
                scanf("%lf",&G[i][j]);
        scanf("%d",&E);
        for(int i=0; i<E; i++){
            int from,to;
            scanf("%d%d",&from,&to);
            dijkstra(from);
            if(safe[to])
                printf("%.3lf\n",safe[to]);
            else printf("What a pity!\n");
        }
    }
    return 0;
}