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（NLogK)的吧？而且不是把第一个数组做成堆

Posted by TN at 2006-04-24 20:04:48
In Reply To:Re:n个数组如何快速合并？ Posted by:guoxi022 at 2006-04-24 19:58:14 
> 嗯，谢谢指点，不过有没有比第三个方法更好的算法，也能达到O(nlogn)?堆写起来比较复杂。
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