![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
ACM&模板
模板
0iq2333
欢迎访问我的个人主页:0iq2333.github.io
展开
-
最大流ISPA +bfs + 栈优化模板
/* * @Author: NEFU_马家沟老三 * @LastEditTime: 2020-11-16 20:06:23 * @CSDN blog: https://blog.csdn.net/acm_durante * @E-mail: 1055323152@qq.com * @ProbTitle: */#include <bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i, a, n原创 2020-11-16 20:07:46 · 146 阅读 · 0 评论 -
最小费用最大流spfa + ek 算法模板
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i, a, n) for (int i = a; i <= n; i++)#define per(i, a, n) for (int i = n; i >= a; i--)#define lowbit(x) ((x) & -(x))#define lson l, mid, rt << 1#defin原创 2020-11-09 18:02:42 · 131 阅读 · 0 评论 -
最大流——Dinic弧优化模板
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define rep(i, a, n) for (int i = a; i <= n; i++)#define per(i, a, n) for (int i = n; i >= a; i--)#define lowbit(x) ((x) & -(x))#define lson l, mid, rt << 1#defin原创 2020-11-05 19:44:39 · 81 阅读 · 0 评论