POJ 2752 Seek the Name, Seek the Fame

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
const int MAXN=400000+5;
int init(){
    int rv=0,fh=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-') fh=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        rv=(rv<<1)+(rv<<3)+c-'0';
        c=getchar();
    }
    return fh*rv;
}
char s[MAXN];
int nxt[MAXN],cnt[MAXN],num;
void getnxt(){
    nxt[0]=-1;
    int k=-1,j=0,len=strlen(s);
    while(j<len){
        if(k==-1||s[j]==s[k]){
            nxt[++j]=++k;
        }else k=nxt[k];
    }
}
int main(){
    freopen("in.txt","r",stdin);
    while(scanf("%s",s)==1){
        getnxt();
        num=0;
        int len=strlen(s);
        int k=nxt[len-1];
        while(k!=-1){
            if(s[k]==s[len-1]) cnt[++num]=k+1;
            k=nxt[k];
        }
        for(int i=num;i>=1;i--) printf("%d ",cnt[i]);
        printf("%d\n",len);
    }
    fclose(stdin);
    return 0;
}