摘要:
spfa版费用流: 1 //最小费用最大流spfa版,求最大费用只需要取相反数,结果取相反数即可。 2 //点的编号0~n-1 3 const int MAXN = 10000; 4 const int MAXM = 100000; 5 const int INF = 0x3f3f3f3f; 6 s... 阅读全文
摘要:
isap+bfs初始化+栈优化,点的编号从0开始: 1 const int MAXN = 100010; 2 const int MAXM = 400010; 3 const int INF = 0x3f3f3f3f; 4 struct Edge 5 { 6 int to, n... 阅读全文
摘要:
循环版,点的编号从0开始: 1 const int MAXN = 2010; 2 const int MAXM = 1200012; 3 const int INF = 0x3f3f3f3f; 4 struct Edge 5 { 6 int to, next, cap, flow; 7 }... 阅读全文