 |
| ||||
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 | |||||||||
那个三分的方法中有介绍这种tradeoff...这程序整了我一个晚上加一个上午..faint.In Reply To:Re:pf您写O(n)的suf tree.不过suf tree的内存就是要比suf array大些吧，印象中最好的内存也要16n/3.不过hqm说有种办法可以用k倍的时间换sqrt(k)的空间....不知道有谁看过类似的论文么？ Posted by:Iambitious at 2006-05-10 13:16:44 > 恩，空间肯定会大，尤其用java，所有都是对象，比较花时间和空间，一般suffix tree的空间应该是O(n * |E|)，｜E｜为符号表的大小。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
