做了HDU 3336 这题小case
k=next[n] 是最长的前缀 这题还要求不是最长的前缀 那么就 k = next[k]
#include <cstdio>
#include <cstring>
const int maxn = 400010;
const int mod = 10007;
char a[maxn];
int f[maxn];
int dp[maxn];
int n, flag;
void print(int k)
{
if(!k)
return;
print(f[k]);
if(flag++)
printf(" ");
printf("%d", k);
}
void getFail()
{
f[0] = f[1] = 0;
for(int i = 1; i < n; i++)
{
int j = f[i];
while(j && a[i] != a[j])
j = f[j];
f[i+1] = a[i] == a[j] ? j+1 : 0;
}
print(n);
printf("\n");
}
int main()
{
while(scanf("%s", a) != EOF)
{
flag = 0;
n = strlen(a);
getFail();
}
return 0;
}
POJ 2752 Seek the Name, Seek the Fame / KMP,布布扣,bubuko.com
POJ 2752 Seek the Name, Seek the Fame / KMP
原文：http://blog.csdn.net/u011686226/article/details/22071175