随笔分类 -  Edmonds_Karp（最大流最短路径增广）

HDU 3549 Flow Problem（最大流最短路径增广）
摘要：Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3301Accepted Submission(s): 1552Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted dir. 阅读全文
posted @ 2012-08-14 21:09 Suhx 阅读(273) 评论(0) 推荐(0)