网络流
卡常带师
这个作者很懒,什么都没留下…
展开
-
codeforces Yet Another DAG Problem
题目链接:https://codeforces.com/contest/1430/problem/G这个题目可以采用状态压缩DP求解,最简单的是O(n*3^n)的暴力状态压缩DP,但是复杂度是不允许的,优化的也不会。这里参考了这篇博客,采用了最小割的建模方式,求解这个题目(https://www.luogu.com.cn/problem/solution/CF1430G)这里提供一个O(n*3^n)的状态压缩DP//#define LOCAL#include <bits/stdc++.h&.原创 2020-11-10 23:25:46 · 158 阅读 · 0 评论 -
学习笔记--网络流24题(下)
题目链接:https://www.luogu.com.cn/problem/P3355技巧:对于棋盘类的题目,考虑黑白染色构图,需要分析同类型颜色之间是否存在互相影响的关系(是否能建边),如果同种颜色之间不存在任何关系,则满足二分图定义,朝着最小覆盖,最大独立集思考即可。本题是求最大独立集//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) me原创 2020-10-22 15:20:11 · 105 阅读 · 0 评论 -
学习笔记--网络流24题(上)
题目链接:https://www.luogu.com.cn/problem/P1251技巧:本题将每个天拆分为两个阶段 (白天,晚上)每天晚上会收到脏餐巾(来源:当天早上用完的餐巾,在这道题中可理解为从原点获得),每天早上又有干净的餐巾(来源:购买、快洗店、慢洗店)。//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,si原创 2020-10-15 12:50:13 · 1917 阅读 · 0 评论 -
HDU6767 费用流+建图
//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a input\n")#define fi first#define se second#define mk(.原创 2020-07-26 21:01:28 · 274 阅读 · 0 评论 -
P6113 带花树模板----一般图最大匹配
//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a input\n")#define fi first#define se second#define mk.原创 2020-07-17 13:30:31 · 92 阅读 · 0 评论 -
最大流最小费用-SPFA nowcoder H:Minimum-cost Flow
//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a input\n")#define fi first#define se second#define mk.原创 2020-07-15 15:19:55 · 147 阅读 · 0 评论 -
最大最小费用流模版
1.AcWing382 k方格取数 最大费用流模版#include <stdio.h>#include <algorithm>#include <iostream>#include <string.h>#include <queue>#include <math.h>using namespace std;#define INF 0x3f3f3f3f#define num(i, j, k) ((i - 1) *原创 2020-05-13 00:33:40 · 165 阅读 · 0 评论 -
无向图求最少删除多少点使得剩下的图不连通 网络流最小割+拆点
//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a...原创 2020-05-07 12:21:02 · 1028 阅读 · 0 评论 -
HDU4280-Dinic+当前弧+多路增广
#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DBG printf("this is a input\n")#define first fi#defi...原创 2020-02-17 13:15:36 · 134 阅读 · 0 评论 -
最大流求最大二分匹配(加入超级源点和汇点,给边权为1)
#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DBG printf("this is a input\n")#define first fi#defi...原创 2020-02-10 19:01:34 · 132 阅读 · 0 评论 -
匈牙利前向星实现求二分图最大匹配
#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DBG printf("this is a input\n")#define first fi#defi...原创 2020-02-10 18:36:16 · 88 阅读 · 0 评论 -
Dinic之当前弧优化 POJ1459
#include <stdio.h>#include <iostream>#include <algorithm>#include <string.h>#include <queue>using namespace std;#define ll long long#define mem(a, b) memset(a,b,...原创 2020-02-10 14:55:31 · 94 阅读 · 0 评论 -
最大流最小费用 dij+势函数+前向星 POJ2195
#include <stdio.h>#include <algorithm>#include <iostream>#include <string.h>#include <queue>#include <math.h>using namespace std;#define INF 0x3f3f3f3f#def...原创 2020-02-03 21:13:46 · 185 阅读 · 0 评论 -
Dinic前向星
#include <queue>#include <algorithm>#include <iostream>#include <stdio.h>#include <string.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,...原创 2020-01-29 13:40:47 · 82 阅读 · 0 评论 -
最大流-Dinic算法(矩阵)
#include <stdio.h>#include <algorithm>#include <string.h>#include <queue>#include <iostream>using namespace std;int w[205][205],deep[205];int n, m, ans= 0;queue...原创 2020-01-28 23:50:19 · 248 阅读 · 0 评论 -
最大流EK算法模版-POJ1273
#include <stdio.h>#include <string.h>#include <algorithm>#include <string>#include <queue>using namespace std;#define ll long long#define mem(a, b) memset(a,b,siz...原创 2020-01-28 16:56:34 · 86 阅读 · 0 评论