摘要：
解题报告：http://blog.sina.com.cn/s/blog_6635898a0100pdlu.html#includeusing namespace std;const int nMax = 405;const int eMax = 1500; struct{ int st, ed, w;}inl[nMax];struct{ int v, cap, cost, next, re;}edge[eMax];int n, ans;int k, edgeHead[nMax];int que[nMax], pre[nMax], dis[nMax];bool vis[nMax]... 阅读全文