网络流
文章平均质量分 78
Lee丶0767
这个作者很懒,什么都没留下…
展开
-
HDU 1532 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原创 2016-10-18 21:14:06 · 293 阅读 · 0 评论 -
HDU 3313 Key Vertex (网络流)
问题描述: Problem Description You need walking from vertex S to vertex T in a graph. If you remove one vertex which stops you from walking from S to T, that vertex we call as key vertex. Now you are give原创 2016-10-25 17:36:16 · 237 阅读 · 0 评论