网络流
老焦哥
这个作者很懒,什么都没留下…
展开
-
POJ 3436-ACM Computer Factory(EK增广路算法)
我是傻逼,把Sample Inout 等词汇也加进去处理了,傻逼!#include #include #include #include using namespace std;const int maxn = 210;const int INF = 268435455;int n, m, f;int flow[maxn][maxn], cap[maxn][m原创 2016-09-27 10:29:11 · 228 阅读 · 0 评论 -
poj-2195 Going-Home(最小费用最大流)
DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little原创 2016-09-30 19:30:30 · 275 阅读 · 0 评论 -
HDU 4280 (网络流Dinic算法)
转自:http://www.cnblogs.com/liuxin13/p/4717668.html#include #include #include #include using namespace std;const int maxn = 100005;const int oo = 1e9 + 7;int x, y, n, m;int source = oo, si转载 2016-09-30 22:04:16 · 287 阅读 · 0 评论 -
HDU 4289 - Control(最大流-ISAP模板)
Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the source) to anothe原创 2016-10-17 17:29:38 · 247 阅读 · 0 评论 -
hdu 3605-Escape(网络流SAP模板+缩点)
EscapeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 9647 Accepted Submission(s): 2293Problem Description2012 If this is the原创 2017-02-28 21:13:20 · 243 阅读 · 0 评论 -
hihocoder 1591 - 锦标赛(费用流)
思路:拆点,每个点拆成两个,限流的不用多说了吧。然后,关键在于某点A和B有边,但是实际结果只能二选一,怎么办呢?弄一个辅助点C加边方式(A’,C,1,-SC[A][B]), (B',C,1,-SC[B][A]), (C,C', 1, 0), (C',T, INF, 0); //(U,V,CAP,COST)代码:#include #include #include #inclu原创 2017-09-28 21:22:59 · 249 阅读 · 0 评论