【解题报告】【HDOJ1596】【Floyd最短路】find the safest road

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1596

#include<stdio.h>
#include<string.h>
#define max(a,b) (a>b?a:b)
double map[1005][1005];
int n;
int main()
{
    int t,i,j,k;
    //freopen("1.txt","r",stdin);
    while(scanf("%d",&n)!=EOF)
    {
        
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
                scanf("%lf",&map[i][j]);
        }
        
        for(k=1;k<=n;k++)
        {
            for(i=1;i<=n;i++)
            {
                for(j=1;j<=n;j++)
                    map[i][j]=max(map[i][k]*map[k][j],map[i][j]);
            }
        }
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d",&i,&j);
            if(map[i][j])
                printf("%0.3lf\n",map[i][j]);
            else printf("What a pity!\n");
        }
    }
    return 0;
}