![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最大流
wangyu666777888
只有自己能成就自己。。。
展开
-
Flow Problem
Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input The first line of原创 2015-08-07 12:31:27 · 408 阅读 · 0 评论 -
Drainage Ditches
Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long tim原创 2015-08-07 12:33:28 · 322 阅读 · 0 评论