题目网址 http://poj.org/problem?id=2752
// hdu 1711
//
// Created by 戴志扬 on 2016/12/7.
// Copyright © 2016年 sky.dai. All rights reserved.
//
#include <iostream>
#include <cstdlib>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>
using namespace std;
char str[1000005];
int Next[1000005];
int cnt;
int ans[1000005];
/*int is_prime(int n)
{
if(n==1)
return 1;
for(int i=2;i<=sqrt(n*1.0);i++)
{
if(n%i==0)
return 0;
}
return 1;
}*/
void get_next(int m)
{
m = strlen(str);
Next[0] = -1;
int i = 0, j = -1;
while(i<m)
{
if(j==-1||str[i]==str[j])
{
i++,j++;
Next[i] = j;
//Next[i] = j 可替换为
/*if(str[i]!=str[j])
Next[i] = j;
else Next[i] = Next[j];*/
}
else j = Next[j];
}
}
/*const int MAXN = 1000005,MAXM = 10005;
int S[MAXN],P[MAXM],Next[MAXM];
int KMP(int n,int m)
{
int i=0,j=0;
while(i<n && j<m)
{
//1 若 j = -1,或者当前字符匹配成功(即S[i]==P[j]),都令i++,j++;
if(S[i]==P[j]||j==-1)
i++,j++;
else
{
//匹配失效,i不变,j=Next[j];
j = Next[j];
}
}
if(j==m)
return i-m+1;
else return -1;
}
*/
int main()
{
while (scanf("%s",str)!=EOF)
{
int len = strlen(str);
get_next(len);
cnt = 0;
int t = Next[len-1];
//for(int i=0;i<18;i++)
//cout<<Next[i];
//cout<<endl;
while (t != -1)
{
//cout<<str[t]<<str[len-1]<<endl;
if (str[t] == str[len - 1])
ans[cnt++] = t + 1;
t = Next[t];
//cout<<t<<endl;
}
for (int i = cnt - 1; i >= 0; --i)
{
printf("%d ", ans[i]);
}
printf("%d\n", len);
}
return 0;
}