洛谷 P3381 【模板】最小费用最大流
摘要:
``` include using namespace std; const int N = 1e6+10; const int inf = 0x3f3f3f3f; struct node{ int v, w, nxt, f; }edge[N]; int n, m, st, ed, cnt, mc, 阅读全文
posted @ 2019-02-27 16:34 坤sir 阅读(150) 评论(0) 推荐(0) 编辑