网络流
文章平均质量分 79
Lethelody
这个作者很懒,什么都没留下…
展开
-
BZOJ2502【上下界最小流】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL;typedef unsigned long lo原创 2015-03-30 00:28:08 · 554 阅读 · 0 评论 -
BZOJ3996【最小割】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-25 16:55:13 · 493 阅读 · 0 评论 -
BZOJ3571【最小乘积最大匹配】
/* I will wait for you*/#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-25 20:21:26 · 568 阅读 · 0 评论 -
BZOJ1324【最小割】
二分图最大点权独立集./* I will wait for you */ #include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)原创 2015-04-09 11:15:11 · 396 阅读 · 0 评论 -
BZOJ3894【最小割】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)#define fi fir原创 2015-04-09 09:53:28 · 543 阅读 · 0 评论 -
BZOJ3275【最小割】
要先判断a*a+b*b==c*c这个条件.再判断gcd(a,b)==1.不然会TLE./* I will wait for you */ #include#include#include#include#include#include#include#include#include#include#include#include#include#include#原创 2015-04-09 11:13:18 · 392 阅读 · 0 评论 -
BZOJ3931【最大流】【SPFA】
/* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include原创 2015-04-16 11:18:11 · 504 阅读 · 0 评论 -
BZOJ1934【最小割】
/* I will wait for you */ #include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)#define fi fi原创 2015-04-09 11:16:56 · 440 阅读 · 0 评论 -
BZOJ2561【最小割】
/* I will wait for you */ #include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make(a,b) make_pair(a,b)#define fi fi原创 2015-04-09 11:12:52 · 455 阅读 · 0 评论 -
BZOJ1497【最大权闭合图】
/* I will wait for you */#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define make make_pair#define fi原创 2015-04-20 10:26:50 · 642 阅读 · 0 评论 -
BZOJ2055【上下界费用流】
/* I will wait for you */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #原创 2015-04-14 18:49:43 · 839 阅读 · 0 评论 -
BZOJ2150【最小路径覆盖】
/* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define fi first#define原创 2015-04-04 01:24:41 · 438 阅读 · 0 评论 -
BZOJ1391【最小割】
要加当前弧优化./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define make make_pair#define fi fir原创 2015-04-04 00:10:17 · 697 阅读 · 0 评论 -
POJ2396【上下界网络流】
感觉细节挺多的./* I will wait for you */#include#include#include#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL;typedef unsigned原创 2015-03-26 01:16:52 · 513 阅读 · 0 评论 -
POJ3155【最大密度子图】
似乎被卡精度了.不明觉厉.#include #include #include #include #include #include #include #include using namespace std;typedef long long ll;typedef pair pii;const int maxn = 20010;const int inf = 0原创 2015-06-05 15:03:46 · 563 阅读 · 0 评论