Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:求二分图最大匹配的O(mn)，king's quest怎么做？

Posted by uni at 2005-05-21 14:38:39 on Problem 2239
In Reply To:求二分图最大匹配的O(mn)，king's quest怎么做？ Posted by:frkstyc at 2005-05-21 01:55:37 
和匈牙利算法思想一样的
恩,但是刚才看到有人说匈牙利是ON2的..不知道是怎么弄的
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator