A - Seek the Name, Seek the Fame POJ - 2752---KMP前缀与后缀

第二天叫醒我的不是闹钟，是梦想！

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[i]数组的性质 next[i]表示为以前i的字符组成的这个子串最长的相同前缀后缀长度。
那么我们就要从next[n]往下递归求解，想一想为啥，题目说了必须是母串的前缀与后缀

#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int N=5e5+19;
int f[N];
int n;
vector<int> v;
char s[N];
void init()
{
  for(int i=2,j=0;i<=n;i++)
  {
    while(j&&s[i]!=s[j+1]) j=f[j];
    if(s[i]==s[j+1]) j++;
    f[i]=j;
  }
}
int main()
{
  while(cin>>(s+1))
  {
    v.clear();
    n=strlen(s+1);
    v.push_back(n);
    init();
    int k=n;
    while(f[k])
    {
      k=f[k];
      v.push_back(k);
    }
    reverse(v.begin(),v.end());
    for(int i=0;i<v.size();i++)
    {
      if(i==0) printf("%d",v[i]);
      else printf(" %d",v[i]);
    }
    cout<<endl;
  }
}