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

这样做是真的不行，和java没有关系，这种D&C是期望是O(n)的，不是O(logn)的

Posted by frkstyc at 2005-05-20 15:30:58 on Problem 2104
In Reply To:这个题这样做都超时了，我就有点纳闷了。。。。。 Posted by:faen at 2005-05-20 15:12:12 
> 就是用标准的partion，分治法。对于每一组数据，是O（logn）的。
> 我记得算法书上证明过，这是最快的方法了阿？？
> 那些过了的大牛，把你们的算法说说呗
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