poj-2752 Seek the Name, Seek the Fame **

/*
 * KMP
 *
*/

#include <cstdio>
#include <cstring>
using namespace std;

const int maxL = 400000 + 10;

char str[maxL];
int next[maxL], stack[maxL];

//計算next數組
void preKMP(char *p, int len){
int k, j;

//next[0] = -1 是為了標記第一個值.. 也可以把字元數組往後移一位，這樣next[1] = 0， 比較正常
    next[0] = -1;
    j = 1, k = -1;        //k = -1
    while(j < len){
while(k >= 0 && p[k+1] != p[j]){
            k = next[k];
        }
if(p[k+1] == p[j])
            k++;
        next[j] = k;
        j++;
    }
}


void cal(char *p){
int len = strlen(p);
    preKMP(p, len);

int top = 0;
int curLen = len - 1;
while(curLen >= 0){
        stack[top++] = curLen + 1;
        curLen = next[curLen];
    }

while(top > 1)
        printf("%d ", stack[--top]);
    printf("%d\n", stack[0]);
}

int main(){
while(scanf("%s", str) != EOF){
        cal(str);
    }


return 0;
}