[hdu1596] find the safest road

题目链接

思路：floyed变形，寻找乘积最大的路径

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int n,t,s,e;
double w[1005][1005];
void floyed()
{
    for(int k=1;k<=n;k++)
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
    w[i][j]=max(w[i][j],w[i][k]*w[k][j]);
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(w,0,sizeof(w));
        for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        scanf("%lf",&w[i][j]);
        floyed();
        cin>>t;
        while(t--)
        {
        scanf("%d%d",&s,&e);
        if(w[s][e]==0)
        cout<<"What a pity!"<<endl;
        else
        printf("%.3lf\n",w[s][e]);
        }
    }
    return 0;
}