poj3268Silver Cow Party最短路问题(dijkstra+邻接矩阵转置)
#include#include#include#include#includeusing namespace std;#define INF 1#define MAX 1005int n,m,x,i,j;int map[MAX][MAX],dto[MAX],dfrom[MAX];bool visto[MAX],visfrom[MAX];typedef
