摘要： #include <stdio.h>#include <string.h>#include <queue>using namespace std;const int INF = 0x7fffffff;const int NIL = -1;const int MAXN = 1005;const int MAXM = 100005;typedef pair<int,int> tuple;int N,M;int S,T,K;int u[MAXM];int v[MAXM];int w[MAXM];int first0[MAXN];int next0[MA 阅读全文