 |
| ||||
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 | |||||||||
预处理是多少的,O(N)还是N*logN？我记得那个O(N)(ST)的RMQ系数应该很小的啊，In Reply To:O(N)的RMQ比堆还慢，这个隐藏的常数太大了 Posted by:YUMEN19850720 at 2007-09-14 11:44:17 > 不过也可能是我写得垃圾 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
