poj 2752

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 21404		Accepted: 11173

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

Source

POJ Monthly--2006.01.22,Zeyuan Zhu

 

（一道好题，让我更加理解了next数组。

题意：给一个字符串，找所有子串满足既是母串的前缀又是母串的后缀。

解题思路：因为若满足是母串的后缀，必定最后一个字母是a[len-1]；又因为nex[len-1]的前缀一定与len-1的前面一部分相同（这两个因为都是nex数组的性质。所以只需要对nex[len-1]递归下就好了。

如果还是不理解可以对着nex数组推一下。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
typedef long long ll;
const int maxn = 400000+5;
char a[maxn];
int nex[maxn];
void getn(int len)
{
    int j=-1;
    nex[0]=-1;
    for(int i=1;i<len;++i)
    {
        while(j>-1 && a[j+1]!=a[i]) j=nex[j];
        if(a[j+1]==a[i]) j++;
        nex[i]=j;
    }
}
void print(int n)
{
    if(n==-1) return ;
    print(nex[n]);
    printf("%d ",n+1);
    
}
int main()
{
    while(~scanf("%s",a))
    {
        int len=strlen(a);
        getn(len);
        print(len-1);
        printf("
");
    }
    return 0;
}