Learning Materials
[KMP] matrix67: http://www.matrix67.com/blog/archives/115
[Expand KMP] Liu Yaqiong PPT: http://wenku.baidu.com/view/8e9ebefb0242a8956bece4b3.html
[Application of the "minimal expression" concept in the character string loop homogeneous problem -- 03 Zhou yuan]: 1. Paper 2.ppt
KMP has come to an end for the moment. After just one week, we collected various KMP questions from Google and Baidu. There are still two questions that I don't have to think about before. Maybe I will make up some inspiration one day.
HDU 1711 Number Sequence template question
HDU 1686 oulipo template questions
HDU 2087 climbing strip KMP template questions, or use strstr directly
HDU 3068 longest Retrieval
HDU 4300 clairewd's message expands KMP, which can be exploited by brute force (without any algorithms ).
HDU 2594 Simpsons 'den den talents uses KMP to find the S1 string in S2. The last status value J indicates the longest S2 suffix and S1 prefix.
HDU 3746 cyclic nack1_shortest loop section (the string is followed by X characters to minimize X so that it consists of at least two cycles of a prefix substring)
HDU 1358 period shortest cycle
The cyclic shift of HDU 2203 affinity strings is equivalent to doubling the array and then KMP matching.
HDU 3613 best reward Extension
HDU 3374 string problem min max notation + KMP
HDU 3336 count the string classic, KMP + dp
HDU 4333 revolving digits expansion KMP
Hust 1010 the minimum length is converted to the shortest cycle section.
Hust 1328 string same as hdu3336
The xdu 1154 rhubarb ballot paper finds the prefix position, uses DP [I] to indicate the number of prefix before I, and then finds the suffix. Note that the prefix must start before the suffix.
Fzu 1901 Period ii kmp or extended KMP
Cf149e Martian strings first finds the leftmost position of the matched string prefix in the original string, and then finds whether the suffix is after this position.
Cf182d common divisors shortest cycle and cycle
Cf 126B password next Array
Poj 1226 substrings water. Same as poj3080
Poj 2185 milking Grid
Poj 2406 power strings shortest cycle Section
Poj 2541 binary witch converts the original string to the longest common prefix (even if the data is too watery, the positive solution is status compression DP)
Poj 2752 seek the name, seek the fame understand the mismatch function!
Poj 3080 Blue Jeans enumerate all substrings to see if all sequences match
Poj 3450 same ate identity same as poj 3080
Poj 3167 cow patterns
Poj 3461 oulipo same as HDU 1686
Zoj 3587 Marlon's string expansion KMP + dp
-- The significance of life is to give it a meaningful person.
Original Http://blog.csdn.net/shuangde800,
D_double (reprinted please mark)