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

不过够胆写的话unit capacity network的网络流可以做到O(n^0.5*m)

Posted by 00448264 at 2005-05-18 17:35:37 on Problem 2239
In Reply To:永远不要用网络流做匹配,这是hqm告诉我的,匈牙利是O(N^2)的吧 Posted by:TN at 2005-05-18 17:33:24


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