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 |
求二分图最大匹配的O(mn),king's quest怎么做?In Reply To:弱弱的问一句,啥叫匈牙利算法 Posted by:uni at 2005-05-21 01:02:31 > 匈牙利算法是和KING'S QUEST那题的思想类似吗? Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator