![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最小费用最大流
文章平均质量分 81
飞不起的弱鸡
这个作者很懒,什么都没留下…
展开
-
POJ 3680 Intervals (费用流经典构图题)
DescriptionYou are given N weighted open intervals. Theith interval covers (ai,bi) and weighswi. Your task is to pick some of the intervals to maximize the total weights under the limit th原创 2016-01-23 12:50:37 · 917 阅读 · 0 评论 -
HDU 1533 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原创 2015-08-07 15:26:50 · 384 阅读 · 0 评论 -
POJ 3422 Kaka's Matrix Travels (最大费用最大流)
DescriptionOn an N ×N chessboard with a non-negative number in each grid, Kaka starts his matrix travels withSUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the rig原创 2016-01-23 14:25:05 · 276 阅读 · 0 评论 -
HDU 3667 Transportation (最小费用最大流)
DescriptionThere are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very caref原创 2016-01-23 18:10:37 · 505 阅读 · 0 评论 -
hdu 5619 Jam's store (费用流)
问题描述Jam不好好学习,然后就去帮别人修电脑了,在一家店里,有M个店员,现在有N个顾客,给出每个顾客对应给每个店员的修电脑的时间为Tij,问所有顾客要等待的最少时间。当然,一个顾客在某个店员那里完成之后,那个店员才会执行下一个顾客的任务输入描述第一行T(1≤T≤100),表示T组数据。接下来T组数据:每组数据第一行为M,N(1≤M,N≤20)表示店员数和顾客数接下来NNN行MM原创 2016-01-31 11:08:47 · 752 阅读 · 0 评论