![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
__网络流
BigZong
这个作者很懒,什么都没留下…
展开
-
两极相通——浅析最大—最小定理在信息学竞赛中的应用
简介 本文涵盖了周东《两极相通——浅析最大—最小定理在信息学竞赛中的应用》的大部分内容,文章脉络基本相同,但是加上了我自己对这篇文章的理解以及代码的实现。书写本文的初心是自己在学习最小割与最短路的转换问题的时候无意之间发现了这篇文章,想把这篇文章让更多人知道,故写下本文。 1:Konig定理 主要内容:在任意一个二部图G中,最大匹配数ρ(G)=最小覆盖数c(G). 最小顶点覆盖: ...原创 2020-05-06 10:45:49 · 821 阅读 · 0 评论 -
POJ3436 ACM Computer Factory (最大流-EK)
Description As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the same f...原创 2020-04-09 17:07:24 · 196 阅读 · 0 评论 -
(最大流+合并)HDU-3605 Escape
Problem Description 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the plan...原创 2020-01-09 18:56:45 · 145 阅读 · 0 评论 -
(拆点+最小割)Control ——2012 ACM/ICPC Asia Regional Chengdu Online
Problem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD1from one city (the source) to ...原创 2020-01-09 09:31:19 · 223 阅读 · 0 评论 -
POJ 2516 Minimum Cost(经典最小费用最大流构图)
Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M sup...原创 2020-01-08 12:09:56 · 180 阅读 · 0 评论 -
(最小费用最大流SPFA+zlw)POJ 2195
Description On 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 ma...原创 2020-01-08 08:58:24 · 171 阅读 · 0 评论 -
POJ-1087 A Plug for UNIX
Description You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow of infor...原创 2020-01-03 17:32:25 · 148 阅读 · 0 评论 -
POJ-3281 Dining
Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous meals for his cows, but he forgot to...原创 2020-01-02 21:39:10 · 183 阅读 · 0 评论 -
x^1与边的巧妙结合
从第二位开始,每隔两位看作一个整体,那么一个数异或1的结果就是当前整体里面的另一个数。 我们在网络流问题中会遇到求反向边的问题,那么我们完全可以采用这种方法建边。 这里的建边的意思为,从u到v的权值为w的边添加到链表里面以后,我们可以再添加一条从v到u的权值为w的边。 ...原创 2020-01-02 16:51:51 · 500 阅读 · 0 评论