
网络流
文章平均质量分 88
YOONGI
这个作者很懒,什么都没留下…
展开
-
Drainage Ditches (最大流 EK dinic)
Drainage Ditches 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 tim...原创 2018-11-03 21:47:42 · 180 阅读 · 0 评论 -
POJ 1459 Power Network (多源点最大流 EK)
A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0...原创 2018-11-05 20:01:51 · 234 阅读 · 0 评论 -
ACM Computer Factory (拆点+EK算法)
ACM Computer Factory 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 a...原创 2018-11-05 20:29:31 · 217 阅读 · 0 评论 -
POJ - 1149 PIGS (最大流 Dinic)
PIGS题目链接:http://poj.org/problem?id=1149Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the fa...原创 2019-04-08 17:28:46 · 164 阅读 · 0 评论 -
POJ - 2391 Ombrophobic Bovines (Floyd + 二分 +ISAP)
Ombrophobic BovinesFJ's cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain siren on the farm t...原创 2019-10-07 10:59:53 · 193 阅读 · 0 评论 -
HDU - 5988 Coding Contest (最小费用最大流)
Coding ContestA coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and there would be M directed paths linking these blocks...原创 2019-10-10 09:42:03 · 173 阅读 · 0 评论