poj 3615Cow Hurdles floyd

http://poj.org/problem?id=3615

代码：

#include<iostream>
#include<cstdio>
using namespace std;
#define Max 1000005
int max(int a,int b){return a>b?a:b;}
int min(int a,int b){return a<b?a:b;}
int a[305][305];
int path[305][305];
struct graph{
    int vertex[305];
    int edges[305][305];
    int e, n;
};
void floyd(graph g)
{

    int i, j, k, n = g.n;
    for (i = 1; i <=n; i++)
    for (j = 1; j <=n; j++)
    {
        a[i][j] = g.edges[i][j];
        path[i][j] = -1;
    }
    for (k = 1; k <=n; k++)
    {
        for (i = 1; i <= n; i++)
        for (j = 1; j <=n; j++)
        if (a[i][j]>max(a[i][k] , a[k][j]))
        {
            a[i][j] = max(a[i][k] , a[k][j]);
            path[i][j] = k;
        }
    }
}
int main()
{
    int n, m, t;
    scanf("%d%d%d", &n, &m, &t);
    graph g;
    g.e = 0, g.n =n;
    for (int i = 0; i < 305; i++)
    for (int j = 0; j < 305; j++)
        g.edges[i][j] = Max;
    int p, q, r;
    for (int i = 0; i < m; i++)
    {
        scanf("%d%d%d", &p, &q, &r);
        g.edges[p][q] = r;
    }
    floyd(g);

    for (int i = 0; i < t; i++)
    {
        scanf("%d%d", &p, &q);
        if(a[p][q]<Max)
        printf("%d\n",a[p][q]);
        else
        printf("-1\n");
    }
    return 0;
}