摘要： 最短路 优先队列Dij#include #include #include #include #include #include #define N 100010#define INF 0x3f3f3f3fusing namespace std;typedef pair pii;struct dat{ int u,v,w,next;} a[N];int n,m,s,t;int first[N],done[N],d[N];void dij(){ priority_queue,greater >q; memset(d, 0x3f, sizeof(d)); memset(do... 阅读全文