 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
写个primal-dual吧，过这个肯定没问题。。。In Reply To:朴素的mincost是 O(V^3 E^2) ，那么这题要用什么样的复杂度才能过。。。 Posted by:bluewind at 2007-10-23 09:55:46 > 》50*50，就2500个顶点，每个顶点两三条边，都好几千条边，费用最大2000,最小费用流要O(nmc)，一直超时，到底要怎么搞？ Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
