POJ - 2752 Seek the Name, Seek the Fame next数组应用

题目链接：点击查看

The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm: 

Step1. Connect the father's name and the mother's name, to a new string S. 
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S). 

Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:) 

Input

The input contains a number of test cases. Each test case occupies a single line that contains the string S described above. 

Restrictions: Only lowercase letters may appear in the input. 1 <= Length of S <= 400000. 

Output

For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.

Sample Input

ababcababababcabab
aaaaa

Sample Output

2 4 9 18
1 2 3 4 5

题意：找出这个字符串中所有即是前缀又是后缀的字串的长度

题解：next数组的应用，next[i] 表示的就是 前i-1个字符即使前缀有事后缀的最大的长度，然后不断继续往前找即可

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=400100;
char s[N];
int nex[N],ans[N],len,an;
void getnex()
{
	int i=0,j=-1;
	nex[0]=-1;
	while(i<len)
	{
		if(j==-1||s[i]==s[j]) nex[++i]=++j;
		else j=nex[j];
	}
}
int main()
{
	while(~scanf("%s",s))
	{
		len=strlen(s);
		an=0;
		getnex();
		for(int i=len;i>0;i=nex[i])
			ans[an++]=i;
		for(int i=an-1;i>=0;i--) printf("%d%c",ans[i]," \n"[i==0]);
	}
	return 0;
}