文件名称:suffarray_c
介绍说明－－下载内容均来自于网络，请自行研究使用
后缀数组求最长公共子串
这里的最长公共子串是指的连续的子串，并非经典dp的那种。
aabbc
abc
这两个字符串的最长公共子串为ab
算法复杂度是o(n)的（n为两个字符串长度的和）-suffix array for the longest string of public-public here- the longest string of consecutive refers to the substring. dp is not the kind of classic. Aabbc abc two of the longest string of public substring of ab complexity of the algorithm is o (n) (n 2 and the length of the string)
这里的最长公共子串是指的连续的子串，并非经典dp的那种。
aabbc
abc
这两个字符串的最长公共子串为ab
算法复杂度是o(n)的（n为两个字符串长度的和）-suffix array for the longest string of public-public here- the longest string of consecutive refers to the substring. dp is not the kind of classic. Aabbc abc two of the longest string of public substring of ab complexity of the algorithm is o (n) (n 2 and the length of the string)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
suffarray_c.cpp