Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
原来是KM,写了个最小费用最大流的CODE,想找个题试试,谁能告诉我哪题是的?用Floyd求的Cost,复杂度感觉很高,不知POJ上有没有最小费最大流的题?网上搜了几个,结果一看,都是KM! 另外,不知求最小费用最大流有什么好的算法没?复杂度大概多少? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator