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

疑惑,期待达人解答

Posted by silentsky at 2010-03-12 10:39:16 on Problem 2226
这题二分图建起后,规模最大是25*25=625个点,25*25= 625条边。
为啥跑起匈牙利算法的O(N*M)的还能过呢。。。
难道这个复杂度如此之松?最大可以处理到好多呢?
谢谢了~~~

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