POJ2752 Seek the Name, Seek the Fame(KMP)

题目给出一个字符串，求这个字符串所有的相同前后缀的长度。

KMP的next数组的应用，KMP的next数组在失配时向前跳转的下标，所以从最后一个字符开始访问，不停的向前跳转，每次的next数组值就是答案。因为当最后一个字符开始向前跳转的时候，就已经出现了第一个合法的前后缀，第二次再次跳转的时候，实际上就是在第一次出现的前后缀里在寻找合法的前后缀。。。以此类推，可以有第三次，第四次跳转。

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N=400005;
int nextt[N];
char str[N];
int ans[N];
void makenextt(char p[],int len)
{
    nextt[0]=0;
    for(int i=1,k=0;i<len;i++)
    {
        nextt[0]=0;
        while(k>0&&p[k]!=p[i])
            k=nextt[k-1];
        if(p[k]==p[i])
            k++;
        nextt[i]=k;
    }
}
int main()
{
    while(scanf("%s",str)!=EOF)
    {
        int len=strlen(str);
        makenextt(str,len);
        int k=nextt[len-1];
        int tot=0;
        while(k)
        {
            ans[++tot]=k;
            k=nextt[k-1];

        }
        ans[++tot]=len;
        sort(ans+1,ans+tot+1);
        printf("%d",ans[1]);
        for(int i=2;i<=tot;i++)
            printf(" %d",ans[i]);
        printf("\n");
    }
    return 0;
}

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 22087		Accepted: 11554

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