 |
| ||||
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 | |||||||||
看不懂啊！！！e语不好，谁能翻译成中文吗？In Reply To:谢谢，倍增算法果然很简炼，速度也可以。我又查到一个 DC3 算法，O(3n) 的，编码也不是很烦。在以下网址。 Posted by:ImLazy at 2008-03-07 20:47:07 > http://www.google.cn/search?aq=f&complete=1&hl=zh-CN&newwindow=1&q=Linear+Work+Suffix+Array+Construction&btnG=Google+%E6%90%9C%E7%B4%A2&meta= > > http://www.cs.helsinki.fi/u/tpkarkka/publications/jacm05-revised.pdf Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
