 |
| ||||
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 | |||||||||
pf您写O(n)的suf tree.不过suf tree的内存就是要比suf array大些吧，印象中最好的内存也要16n/3.不过hqm说有种办法可以用k倍的时间换sqrt(k)的空间....不知道有谁看过类似的论文么？In Reply To:made好不容易写了个O(n)的suffix tree，结果还超内存，本来java用内存就比较大，能不能内存方面也给点优惠阿！ Posted by:Iambitious at 2006-05-09 17:36:15 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
