Poj2752 seek the name, seek the fame [KMP]

Seek the name, seek the fame

Time limit:2000 ms		Memory limit:65536 K
Total submissions:11602		Accepted:5680

Description

The little cat is so famous, that could couples tramp over hill and Dale to byteland, and asked the little cat to give names to their newly-born babies. they seek the name, and at the same time seek the fame. in order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm:

Step1. connect the father's name and the mother's name, to a new string S.
Step2. find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S ).

Example: Father = 'ala ', Mother = 'La', we have S = 'ala '+ 'La' = 'alala '. potential prefix-suffix strings of S are {'A', 'ala ', 'alala '}. given the string S, cocould you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name :)

Input

The input contains a number of test cases. Each test case occupies a single line that contains the string s described above.

Restrictions: Only lowercase letters may appear in the input. 1 <= length of S <= 400000.

Output

For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.

Sample Input

ababcababababcababaaaaa

Sample output

2 4 9 181 2 3 4 5

Question: Given a string, find its substring length. The substring must satisfy both the prefix and suffix of the primary string, output the length of all substrings in ascending order. Question: the simple use of the next array (but it has been a long time to read the question ..) After finding the next array, recursively output the corresponding suffix length. Len needs to output it separately.

#include <stdio.h>#define maxn 400002char str[maxn];int next[maxn], len;void getNext(){int i = 0, j = -1;next[0] = -1;while(str[i]){if(j == -1 || str[i] == str[j]){++i; ++j;next[i] = j; //mode 1}else j = next[j];}len = i;}void getVal(int n){if(next[n] == 0) return;getVal(next[n]);printf("%d ", next[n]);}int main(){//freopen("stdin.txt", "r", stdin);while(scanf("%s", str) == 1){getNext();getVal(len);printf("%d\n", len);}return 0;}

Poj2752 seek the name, seek the fame [KMP]