摘要：
题解：最短路模板题#include #include #include #include using namespace std; const int N=20005; const int INF=9999999; typedef pairseg; priority_queue,vector,greater >q; int d[N],head[N],u[N],v[N],w[N],next[N],n,m,a,b,c; bool vis[N]; void build(){ memset(head,-1,sizeof(head)); for(int e=1;... 阅读全文