#include"iostream"
#include"algorithm"
#include"vector"
#include"queue"
#include"map"
#include"cstdio"
#include"string"
#include"stack"
#include"set"
#include"cstring"
#include<cmath>
using namespace std;
int a[1000000],c=0;
int m,n;
string s;
int Next[1000000];
void getNEXT()
{
memset(Next, 0, sizeof(Next));
int j, k;
j = 0; k = -1; Next[0] = -1;
while (j < n){
if (k == -1 || s[j] == s[k])
Next[++j] = ++k;
else
k = Next[k];
}}
int main()
{
while(getline(cin,s))
{
n=s.length();
getNEXT();
c=0;
memset(a,0,sizeof(a));
for(int i=n;Next[i]!=-1;i=Next[i])
{
a[c++]=i;
}
for(int i=c-1;i>0;i--)
printf("%d ",a[i]);
printf("%d\n",a[0]);
}
return 0;
}
poj-2752
最新推荐文章于 2019-06-29 14:24:23 发布