POJ 2752 Seek the Name, Seek the Fame (KMP的next函数运用)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<string>
#include<iostream>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#include<stdlib.h>
#include<algorithm>
#define LL __int64
using namespace std;
const int MAXN=100000+5;
char str[MAXN];
int nex[MAXN];
int ans[MAXN];
int n;
void getnext()
{
    int j=0,k=-1;
    nex[0]=-1;
    while(j<n)
    {
        if(k==-1 || str[j]==str[k])
            nex[++j]=++k;
        else
            k=nex[k];
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%s",str)!=EOF)
    {
        n=strlen(str);
        getnext();
        int i=n,tot=0;
        while(nex[i]!=-1)
        {
            ans[tot++]=i;
            i=nex[i];
        }
        for(int i=tot-1;i>=0;i--)
        {
            if(i==tot-1) printf("%d",ans[i]);
            else printf(" %d",ans[i]);
        }
        printf("\n");
    }
    return 0;
}