liusy_21的博客

http://acm.hdu.edu.cn/showproblem.php?pid=2544题意描述：A，B为路口编号，C为AB之间的权值，计算最短路Floyd方法#include <stdio.h>#include <cstring>#include <string.h>#include <iostream>using na...

#define Max 0x3f3f3f3f#define maxn 10010int n,m;int Map[maxn][maxn];int dist[maxn];int vist[maxn];Floyd：void floyd(){ int i,j,k; for (k=1; k<=n; k++) for(i=1; i<=n; i...