摘要：
#include<iostream>#include<cstdio>#include<cstring>#include<queue>#include<algorithm>using namespace std;const int maxn = 1005;const int maxm = 100005;const int INF = 0x3f3f3f3f;int N,M,X;int first[maxn];int en;int d[maxn],d1[maxn];struct Edge{ int u,v,w; int next; void 阅读全文
