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:原来最好的算法，就是使用分治思想的经典第k元素算法

Posted by accept123 at 2009-12-14 22:25:21 on Problem 2104
In Reply To:原来最好的算法，就是使用分治思想的经典第k元素算法 Posted by:hyerty at 2009-08-21 11:32:14 
> 1. 排序，6000ms+，时间复杂度高，算法复杂度低，推荐。
> 2. 线段树+二分，2000ms，时间复杂度中，算法复杂度高，不推荐。
> 3. 经典第k元素算法，500ms-，时间复杂度低，算法复杂度中，推荐。

但是每次排序后不是要另外复制到另一个数组吗？？那么不是很慢嘛，各位大牛市著名解决的啊
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