后缀数组
文章平均质量分 55
JacquesdeH
.
展开
-
Tyvj 1860 后缀数组 [Suffix Array 裸题]
一句话,输出文本串的sa数组和height数组要注意细节!!! 注意rank下标 0~lens-1 ;而 sa下标 1~lens ;height下标为2~lens 所以带入da() 时 lens要+1!! 还有在读入时注意不要使用0,从1开始!! 否则后面判断相等时可能会dead loop!!另外坑father的地方!! 用printf直接T 但是用cout却不会??!!! yyr大神说可以原创 2016-07-29 21:16:45 · 379 阅读 · 0 评论 -
HDU 4691 Front Compression [后缀数组] [LCP]
Front compression Time Limit: 5000MS Memory Limit: 102400KB 64bit IO Format: %I64d & %I64uDescription Front compression is a type of delta encoding compression algorithm whereby common prefixes and原创 2016-07-30 13:02:32 · 339 阅读 · 0 评论 -
HDU 1403 Longest Common Substrung [后缀数组] [LCP] [LCS]
Longest Common Substring Time Limit: 4000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64uDescription Given two strings, you have to tell the length of the Longest Common Substring of them. F原创 2016-07-31 10:49:44 · 920 阅读 · 0 评论