HDU 3549 Flow Problem 最大流 最小增广路 EK算法 传说中的入门算法
题目描述
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 input contains a
原创
2013-06-25 16:39:26 ·
1577 阅读 ·
0 评论