POJ 2752 Seek the Name, Seek the Fame

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K

Description

The little cat is so famous, that many 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, could 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

ababcababababcabab
aaaaa

Sample Output

2 4 9 18
1 2 3 4 5

题目大意：给定一个字符串输出其中既是前缀又是后缀的子串的长度
解题思路：借助KMP算法中的next数组 next[i]的值表明在字符串中i之前的子串长度为next[i]的前缀和后缀相同

下标	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18
字符串	a	b	a	b	c	a	b	a	b	a	b	a	b	c	a	b	a	b
Next[i]	0	0	1	2	0	1	2	3	4	3	4	3	4	5	6	7	8	9

对KMP不太熟悉的可以看这里:从头到尾理解KMP算法 　　　　　　

 

AC代码：

#include <stdio.h>
#include <string.h>
int next[400010];
char str[400010];
void getnext()  //先求出next数组
{
    int i = 0,j = -1;
    next[0] = -1;
    int len = strlen(str);
    while (i < len)
    {
        if (j == -1 || str[i]==str[j])
        {
            ++ i;
            ++ j;
            next[i] = j;
        }
        else
            j = next[j];
    }
}
int main()
{
    int num[400010],i,k;
    while (scanf("%s",str)!=EOF)
    {
        int len = strlen(str);
        getnext();
        num[0] = len;
        k = 1;
        while (next[num[k-1]]) //借助next数组将既是前缀有是后缀的子串的长度
        {
            num[k] = next[num[k-1]];
            k ++;
        }
        for (i = k-1; i > 0; i --)
            printf("%d ",num[i]);
        printf("%d
",num[0]);
    }
    return 0;
}