Seek the Name, Seek the Fame---poj2752（kmp中的Next数组）

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;

const int N = 4*1e5+7;

char s
;
int Next
, n, a
;

void GetNext()
{
int i=0, j=-1;
Next[0] = -1;
while(i<n)
{
if(j==-1 || s[i] == s[j])
Next[++i] = ++j;
else
j=Next[j];
}
}
int main()
{
int i;
while(scanf("%s", s)!=EOF)
{
n = strlen (s);
GetNext();
a[0] = n;
i=1;
while(Next[a[i-1]]!=0)
{
a[i] = Next[a[i-1]];
i++;
}
sort(a, a+i);
for(int j=0; j<i; j++)
printf("%d%c", a[j], i-1==j?'\n':' ');
}
return 0;
}