Floyd算法

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1874

#include#define max 210#define maxn 99999999int e[max][max];void Floyd(int N){  int i,j,k;  for(i=0;ie[j][i]+e[i][k]){            e[j][k]=e[i][j]+e[i][k];          }}main(){  int a,b,c,N,M,Q,i,j,s,t;  while(scanf("%d%d",&N,&M)!=EOF){    for(i=0;i