dezhonger的专栏

https://www.luogu.com.cn/problem/P3254https://www.acwing.com/problem/content/2181/网络流建模，同时求出最大流的一个可行流建模如下求可行流的方法：遍历左边的所有节点，在残留网络上跑满了流的边即为一组解#include <bits/stdc++.h>using namespace std;const int N = 430, M = (N + 150 * 270) * 2, INF =

https://www.acwing.com/problem/content/2174/Dinic算法的时间复杂度是O(N^2M)，N为点数，M为边数模板题：#include <bits/stdc++.h>using namespace std;//Filename: Dinic.cpp////Author: dezhonger - csdisassembly@gmail.com//Create: 2020-11-14 18:48:11//时间复杂度: O(N.

https://www.acwing.com/problem/content/2173/模板题:#include <iostream>#include <cstring>#include <algorithm>using namespace std;const int N = 1010, M = 20010, INF = 1e8;int n, m, S, T;int h[N], e[M], f[M], ne[M], idx;int q[N],

网络流边表存图的EK算法模版。#include #include #include #include #include using namespace std;//hdu1569//最大点权独立集，求出最大流，然后用总和减去最大流//主要是学习下最大流算法//EK算法, 我们用边表存储图const int inf = 10000000;const

参考：http://blog.csdn.net/non_cease/article/details/6744074题目是poj2135下面的代码可作为模版。。。//824K 16ms#include <iostream>#include <cstring>#include <cstdio>using namespace std;#...