POJ 2752 Seek the Name, Seek the Fame kmp(后缀与前缀)

//作者:1085422276
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
//#include<bits/stdc++.h>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
const int inf = 10000000;
inline ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch<‘0‘||ch>‘9‘)
    {
        if(ch==‘-‘)f=-1;
        ch=getchar();
    }
    while(ch>=‘0‘&&ch<=‘9‘)
    {
        x=x*10+ch-‘0‘;
        ch=getchar();
    }
    return x*f;
}
ll exgcd(ll a,ll b,ll &x,ll &y)
{
    ll temp,p;
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    p=exgcd(b,a%b,x,y);
    temp=x;
    x=y;
    y=temp-(a/b)*y;
    return p;
}
//*******************************
char a[400005];
    int maxl[400005],p[400005];
int main()
{

     while(gets(a)!=NULL)
     {
         int n=strlen(a);
          memset(p,0,sizeof(p));
          int j=0;
          for(int i=1;i<n;i++)
          {
              while(j>0&&a[j]!=a[i])j=p[j];
              if(a[j]==a[i])j++;
              p[i+1]=j;
          }
          int cnt=0;
          maxl[++cnt]=n;
          int i=n;
          while(p[n])
          {
              maxl[++cnt]=p[n];
              n=p[n];
          }
          for(int i=cnt;i>1;i--)
          {
             printf("%d ",maxl[i]);
          }
          printf("%d\n",maxl[1]);
     }
    return 0;
}