最大流
Shili_Xu
闽粤田头一村夫而已。
展开
-
HDU 3549 Flow Problem(Edmond Karp算法)
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.InputThe first line of input contains an integer T, ...原创 2018-05-17 23:35:05 · 223 阅读 · 0 评论 -
HDU 2732 Leapin' Lizards(Dinic算法)
Leapin' LizardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3664 Accepted Submission(s): 1498Problem DescriptionYour platoon of wandering ...原创 2018-07-13 21:54:16 · 267 阅读 · 0 评论