 |
| ||||
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 | |||||||||
Re:匈牙利算法+优化水过……Orz jsIn Reply To:匈牙利算法+优化水过……Orz js Posted by:This_poet at 2011-09-23 21:36:27 > 这题裸的匈牙利算法必然TLE得很惨，然而如果在比赛时木有想到贪心，只看到了匈牙利算法，于是想到神js(POJ User：yefllower)提过的匈牙利算法优化：先搜出一个匹配，然后再按照匈牙利算法来寻找增广路，这样的复杂度接近线性【这是可以证明的】，于是800+ms水过…… > 再次Orz js…… 用Dinic水过，125ms... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
