摘要:
这道题有点坑啊。。。要考虑重边,即输入时重边时要去最短那个。。。代码:#include<iostream>#include<cstring>#include<cstdio>using namespace std;#define Max 0xfffffffint map[1001][1001];int dis[1001],hash[1001],pay[1001][1001],pd[1001];int n,m;void djs(int v,int d){ int i,j,min,index;for(i=1;i<=n;i++) {dis[i]=map[v][ 阅读全文