网络流
文章平均质量分 88
lyyy.
这里介绍不了我
展开
-
poj 3041 Asteroids -二分匹配-最小顶点覆盖
AsteroidsBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid. Fortunat原创 2016-10-09 20:02:18 · 475 阅读 · 0 评论 -
uva 1515 Pool construction(最小割)
uva 1515 Pool construction(最小割)原创 2017-04-24 18:08:43 · 301 阅读 · 0 评论 -
uva 11082 Matrix Decompressing - 最大流
uva 11082 Matrix Decompressing - 最大流原创 2017-04-23 23:46:11 · 598 阅读 · 0 评论 -
uva 1658 Admiral - 拆点+最小费用流
uva 1658 Admiral Michiel Adriaenszoon de Ruyter is the most famous admiral in Dutch history and is well known for his role in the Anglo-Dutch Wars of the 17th century. De Ruyter personally commanded a flagship and issued commands to allied warships during n原创 2017-04-21 18:52:31 · 707 阅读 · 0 评论 -
hdu 2063 过山车 -二分图匹配
RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到经费问题,boss刘决定只让找到partner的人去坐过山车,其他的人,嘿嘿,就站在下面看着吧。聪明的Acme原创 2017-03-08 20:50:19 · 293 阅读 · 0 评论 -
poj2135 Farm Tour -最小费用流
Farm TourDescriptionWhen FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <= M <=原创 2016-10-19 21:14:44 · 501 阅读 · 0 评论 -
网络流之最大流-Ford-Fullkerson算法 DFS && BFS
1、最大流的个人理解举例来说就是一个河流网,从a城市到b城市的河道中有的宽有的窄,问最大水流量能是多少,这个主要取决于这条路上的最窄的河道。2、Ford-Fullkerson算法 (挑战程序设计竞赛 P210)由于有很多条河道可选,例如 路径一:a—c—d—b 或者 路径二:a—c—f—b,按上面的想法,可能出现先走路径1和先走路径2产生的结果不一样,这时候可能是因为a-c这条原创 2016-10-06 19:24:14 · 1931 阅读 · 0 评论 -
poj3469 Dual Core CPU-最小花费-最大流最小割
Dual Core CPUAs more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW.The routine consists of N modules, and each of them should run in a原创 2016-10-18 23:28:12 · 266 阅读 · 0 评论 -
poj3281 Dining-网络流最大流-多对一的匹配
poj3281 DiningCows 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 menu against their preferences. Although he原创 2016-10-18 14:24:31 · 857 阅读 · 2 评论 -
hdu 6124 Smallest Minimum Cut - 最少边最小割-2017 ICPC网络赛青岛站 -1009
hdu 6124 Smallest Minimum Cut - 最少边最小割2017 ICPC网络赛青岛站 -1009Consider a network G=(V,E)with source and sink t. An s-t cut is a partition of nodes set Vinto two parts such that sand tbelong to different parts. The cut set is the subset of Ewith all edges conn原创 2017-09-17 18:06:03 · 724 阅读 · 0 评论