
图论-网络流—最大流
图论
Stephencurry‘s csdn
这个作者很懒,什么都没留下…
展开
-
A Plug for UNIX(POJ-1087)(网络流—最大流)
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 information and id...原创 2019-12-07 10:13:44 · 167 阅读 · 0 评论 -
Dining(POJ-3281)(网络流-最大流)
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 check his me...原创 2019-12-05 19:39:02 · 279 阅读 · 0 评论 -
ACM Computer Factory(POJ-3436)(网络流-最大流)
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 factory. Ever...原创 2019-11-30 10:16:20 · 186 阅读 · 0 评论 -
Drainage Ditches(POJ-1273)(网络流—最大流)
Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Fa...原创 2019-11-26 11:08:41 · 207 阅读 · 0 评论 -
网络流基础概念+三个基本算法
容量网络:设G(V,E),是一个有向网络,在V中指定了一个顶点,称为源点(记为Vs),以及另一个顶点,称为汇点(记为Vt);对于每一条弧<u,v>属于E,对应有一个权值c(u,v)>0,称为弧的容量.通常吧这样的有向网络G称为容量网络. 弧的流量:通过容量网络G中每条弧<u,v>,上的实际流量(简称流量),记为f(u,v); 网络流:所有弧上流量的集合f={f(u...转载 2019-11-26 10:57:35 · 3191 阅读 · 0 评论