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

似乎在规模不超过50万的时候O(n)的rmq pk O(nlogn)的rmq没有优势, 因为O(nlogn)rmq查询代价比O(n)rmq小得多

Posted by sunmoonstar at 2006-11-09 16:18:39 on Problem 3080
In Reply To:没测试,我写的O(nlogn)巨慢无比 Posted by:wywcgs at 2006-11-08 15:04:04
> 不过如果只从算法层面比较的话,我认为 除非规模特大,否则O(n)比O(nlogn)快不到哪去,弄不好还比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