2017年9月9日
luogo_3381【模板】最小费用最大流
摘要： #include<bits/stdc++.h> using namespace std; #define MAXM 500010 #define MAXN 5010 #define INF 100000000 struct Edge{int from,to,cap,flow,cost;}; int 阅读全文
posted @ 2017-09-09 18:44 wqtnb_tql_qwq_%%% 阅读(146) 评论(0) 推荐(0)
luogo_3376 网络最大流
摘要： #include<bits/stdc++.h> using namespace std; #define MAXN 100010 #define INF 100000000 struct Edge{int from,to,cap,flow;}; vector<Edge> edges; vector< 阅读全文
posted @ 2017-09-09 13:39 wqtnb_tql_qwq_%%% 阅读(169) 评论(0) 推荐(0)