Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

雁过留声——攻下第一个后缀数组

Posted by fanhqme at 2009-07-14 18:46:52 on Problem 3729 
感谢这个网址：
http://hi.baidu.com/forsona/blog/item/f821468149287edf9123d91d.html

以前看后缀数组的论文就晕，今天下定决心，读了5遍，
读懂了！
其实后缀数组最牛的就是用O(nlogn)的空间计算height数组，
时常想着把两个串连接在一起，就可以搞定许多神奇的事情了。
这个题其实是计算每个S1的后缀在S2中的最大匹配长度，为了避免写rmq，可以用扫描。

感谢百度百科
http://baike.baidu.com/view/1240197.htm
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator