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

O(nlogn)是有的

Posted by Nova at 2005-07-31 16:21:11 on Problem 2519
In Reply To:Re:请问过了的这题的时间复杂多是多少? Posted by:elyn_e at 2005-07-31 16:18:33
> 我用O(n2)的算法超时了,有更快的算法吗?

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