 |
| ||||
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 | |||||||||
RMQ O(N)-O(1)?In Reply To:Who有后缀数组中求LCP的O(n)-O(1)算法？ Posted by:MetalHeart at 2008-11-19 21:07:51 个人认为O(nlgn)-O(lgn)竞赛中足够了。 为什么一定要O(n)-O(1)的实现，不见得比上面的快。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
