 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
似乎在规模不超过50万的时候O(n)的rmq pk O(nlogn)的rmq没有优势, 因为O(nlogn)rmq查询代价比O(n)rmq小得多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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
