![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
费用流
ffutop
这个作者很懒,什么都没留下…
展开
-
HDU 5988 Coding Contest(最小费用最大流)
HDU 5988 Coding ContestProblem DescriptionA coding contest will be held in this university, in a huge playground. The whole playground would be divided into NN blocks, and there would be MM directed paths原创 2016-11-21 20:14:01 · 923 阅读 · 0 评论 -
Hihocoder 1424 Asa's Chess Problem (有源汇上下界最小费用流)
ProblemAsa comes up with a chess problem. There are N×N chesses on a board with N×N grids, one chess in one grid. Some chesses are black while others are white. The N×N grids are divided into (N×N) / 2原创 2017-07-17 12:55:15 · 1852 阅读 · 0 评论