随笔分类 -  图论算法：拓补图

网络流相关（拓扑）CodeForces 269C：Flawed Flow
摘要：Emuskald considers himself a master of flow algorithms. Now he has completed his most ingenious program yet — it calculates the maximum flow in an und 阅读全文
posted @ 2016-10-02 22:13 TenderRun 阅读(413) 评论(0) 推荐(0)