一直没有写过这道题的最短路做法,感谢sunshine神犇的题解:http://blog.csdn.net/sunshinezff/article/details/48826583
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#define maxn 510
#define inf 1000000000
using namespace std;
int n,m,T;
int f[maxn][maxn];
int main()
{
scanf("%d%d%d",&n,&m,&T);
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
f[i][j]=inf;
for (int i=1;i<=m;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
f[x][y]=z;
}
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (i!=j && j!=k && i!=k)
f[i][j]=min(f[i][j],max(f[i][k],f[k][j]));
while (T--)
{
int x,y;
scanf("%d%d",&x,&y);
if (f[x][y]==inf) printf("-1\n");
else printf("%d\n",f[x][y]);
}
return 0;
}