lcp upgrades

Cut a string into k blocks to minimize the largest block in the Lexicographic Order. Orz wjmzbmr. It takes only one day to understand the problem. You can use LCP (longest common prefix) to quickly compare the size of two substrings. It is enough to compare the size of the next character with the common prefix. With this idea, we can first pre-process the LCP (suffix array + record O (2 nlog (2n) + O (N * n

http://www.lydsy.com/JudgeOnline/problem.php?id=1014By SB wrong tune cry Qaq ... Insert there. Insert to x behind ... I...... Written in the front of the first x ... It's a tune! Good! Long!QaqThe God LCP procedure .... Indicates that only the height of the SA is offline .... This kind of online I just qaq to make a sad expression ...Then worshipped the puzzle .... Good god. Splay Maintenance Interval ... hash+ Two-point maintenance

Topic linksTest instructions: A string containing only lowercase letters for a given length of N (n InputAAAAAbabcabbaaaaaa #Output233 idea: The suffix array is applied to solve the SA array and the height array, and then the common prefix length I of the enumeration suffix, because it cannot overlap, so the adjacent height does not satisfy the LCP >= I. write an understanding of the postfix array multiplication algorithm:1. If you want the value of t

The suffix array has not been put in the title Blog. So dug up a write to enrich the next blog by the way to stay as a Board.A string s in which the contents of different substrings have sigma{n-sa[i]+1-h[i]} (oh H[here) is known Height[])So l=1,r= the above Sigma dichotomy is the number of substrings in the dictionary sequence.Then ask S in the K-large substring w: because h[i] is related to i-1, so we have to subtract from N Downto 1,k-=n-sa[i]+1-h[i] to K.Apparently sweep the substring dictio

1 //suffix array template, Manx size of the arrays2 //the supported operations have a computed suffix array (sa array), which computes the longest common prefix (height array) of the two adjacent elements, using get_height ();3 //calculate the longest common prefix for two suffixes A, and B, first use Lcp_init (), and then call GET_LCP (A, b) to get4 //The following n is the length of the input string +1 (n = strlen (s) + 1), and M is the range of the template m=128 expressed in letters, numbers

Test instructions: Finding the longest palindrome stringThis has a special O (n) set of board algorithms, but as an exercise or a suffix array to solve itSimply reverse the same string (in the middle with a sufficiently small and non-appearing character), then enumerate the midpoint of the palindrome, and continue to solve the forward and backward calculation of \ (lcp\) .There's a bug in the template that's been changed.One notable place is the probl

Http://acm.hdu.edu.cn/showproblem.php?pid=4691Last summer, more school races were titled. At that time, there was no suffix arrayToday will be, in fact, its own suffix array combination rmq or to, but, test instructions understand a problem, and then toss it for a long time,,,Here is a brief explanation of the topic, hoping to help the reader to take the last set of data as an exampleMyxophytamyxopodnabnabbednabbingnabit62 {9 1616 1919 2525 3232 37The first two lines do not explain, the topic is

This is also a simple topic, but the key is test instructions understanding.The title is in the sentence: Write a function to find the longest common prefix string amongst an array of strings.Test instructions is a string array that finds the longest common prefix of all strings in this string array.Note that it is a qualified prefix, not a substring.So, the direct solution is to compare each character by the first string as a benchmark. The algorithm complexity is also obviously O (m*n), M is t

Title Link: Http://codeforces.com/problemset/problem/504/ETest instructions: Give a tree, with a letter on each node. Each query gives two paths, asking the longest common prefix of the strings for both paths.Idea: The tree chain, record each chain of strings, both positive and negative are recorded, forming a large string. Record the position of each chain corresponding to the string in the large string. The suffix array is then evaluated for the large string. The last question is the query on

Find the longest palindrome substring, and this problem requires the first appearance, SA+LCP solve. Original idea: First inversion, splicing the original string and the reverse string, and then the longest common prefix of the two, the only thing to note is if there are more than one group to output the first group to appear. The original idea was wrong. Counter example: Zzzdzaadzzz. Can find their own, really not, to the Great God blog under the rea