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(n^2)的解法,用次小生成树时间复杂度为o(n^3)

Posted by Ruby931031 at 2012-09-11 18:05:38 on Problem 1679
In Reply To:据说这题有o(n^2)的解法,用次小生成树时间复杂度为o(n^3) Posted by:lbt at 2010-11-13 09:33:53
次小生成树就是O(N^2)吧

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