最小费用流
文章平均质量分 86
mrcoderrev
C
展开
-
hdu 2686 Matrix(最大费用流||多线程DP)@
Yifenfei very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. Every time yifenfei should to do is that choose a detour which frome the top lef原创 2017-04-26 20:26:58 · 283 阅读 · 0 评论 -
hdu 1533 Going Home (费用流)
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 man, you need t原创 2017-01-18 18:15:16 · 194 阅读 · 0 评论 -
hdu 3395 Special Fish (费用流 最大费用 不一定最大流)@
There is a kind of special fish in the East Lake where is closed to campus of Wuhan University. It’s hard to say which gender of those fish are, because every fish believes itself as a male, and it ma原创 2017-01-22 15:13:12 · 206 阅读 · 0 评论 -
hdu 3435 A new Graph Game (费用流处理环)@
An undirected graph is a graph in which the nodes are connected by undirected arcs. An undirected arc is an edge that has no arrow. Both ends of an undirected arc are equivalent--there is no head or t原创 2017-01-22 17:35:35 · 173 阅读 · 0 评论 -
hdu 3667 Transportation (最小费用流 拆边法)@
There 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 careful. The more go原创 2017-01-21 01:59:36 · 218 阅读 · 0 评论 -
51 nod 1392 装盒子(费用流||二分图 骚)
1392 装盒子 基准时间限制:1 秒 空间限制:131072 KB 分值: 160 难度:6级算法题 收藏 关注 有n个长方形盒子,第i个长度为Li,宽度为Wi,我们需要把他们套放。注意一个盒子只可以套入长和宽分别不小于它的盒子,并且一个盒子里最多只能直接装入另外一个盒子 (但是可以不断嵌套),例如1 * 1 可以套入2 * 1,而2 *原创 2017-10-02 17:09:32 · 327 阅读 · 0 评论 -
hdu 5988 Coding Contest(最小费用流 骚)
题意:给n个点与m条单向路。每个点有si的人与bi的食物。每条路给定ui , vi , ci and pi 分别表示起点、终点、流量、碰断线的概率。 每条单向路在第一个人走的时候碰断线的概率为0,第2、3…人走碰断线的概率为pi。 问在保证所有人每人能吃到一份食物的前提下,有人碰断线的最小概率是多少? 骚操作:1 因为第一个人碰线概率为0 所以将路径上的流量分出来一条边 代价为0 骚操原创 2017-09-30 23:49:53 · 262 阅读 · 0 评论 -
HDU 3315 My Brute(考虑优先次序的费用流)@
Seaco is a beautiful girl and likes play a game called “My Brute”. Before Valentine’s Day, starvae and xingxing ask seaco if she wants to spend the Valentine’s Day with them, but seaco only can spend原创 2017-08-14 10:36:18 · 293 阅读 · 0 评论 -
hdu 6118 度度熊的交易计划(费用流)
度度熊的交易计划 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 611 Accepted Submission(s): 212 Problem Description 度度熊参与了喵哈哈村的商业大会,但是原创 2017-08-14 10:20:03 · 254 阅读 · 0 评论 -
hdu 3488 Tour HDU (费用流)
In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should b原创 2017-01-18 23:04:36 · 208 阅读 · 0 评论