![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
文章平均质量分 78
WudHHH
这个作者很懒,什么都没留下…
展开
-
Farm Tour (最小费用最大流)
When 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 t原创 2017-07-15 01:00:41 · 551 阅读 · 0 评论 -
hdu - 6350
Topic 题目链接 Always Online Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 208 Accepted Submission(s): 66 Problem Description Wayne is...原创 2018-08-10 10:41:47 · 677 阅读 · 0 评论