 |
| ||||
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 | |||||||||
Re:Hash，不用后缀数组，235MS不犹豫In Reply To:Hash，不用后缀数组，235MS不犹豫 Posted by:NeverWin at 2011-06-27 12:20:33 Orz... 我正准备硬着头皮学习后缀数组时，一见此贴，顿时豁然开朗。。。 不过虽然我是用hash找最长公共前缀，复杂度是O(nlogn)的，却用了1360ms，囧。。。 Orz神牛。。。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
