Seek the Name, Seek the Fame +poj+next数组的理解

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11717		Accepted: 5730

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

解决方案：本题是考察next数组的理解，由于next求得是最大前后缀，所以第一个考虑应该是字符串全部，第二在考虑整串的最大前后缀，然后再从最大前后缀中再找前后缀，直到next归-1截止。由于它要从小到大输出，所以可先入栈。

code：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stack>
using namespace std;
const int maxn=400003;
char text[maxn];
int next[maxn];
void getnext(int len){
    int i=0,j=-1;
    next[0]=-1;
    while(i<len){
        if(j==-1||text[j]==text[i]){
            j++,i++;
            next[i]=j;
        }
        else j=next[j];
    }

}
int main()
{
    while(~scanf("%s",text)){
        int len=strlen(text);
        getnext(len);
        stack<int>S;
        S.push(len);
        int i=len;
        while(next[i]>=1){
            S.push(next[i]);
            i=next[i];
        }
        while(!S.empty()){
            int s=S.top();
            S.pop();
            printf("%d%c",s,S.empty()?'\n':' ');
        }
    }
    return 0;
}