POJ 2752 Seek the Name, Seek the Fame KMP

Seek the Name, Seek the Fame Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10698   Accepted: 5197 Description 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 Source POJ Monthly--2006.01.22,Zeyuan Zhu

题目大意：求一个字符串前n和元素和后n个元素相等的情况，n有多少个。

对next数组性质（谁能告诉我究竟有什么性质啊啊啊啊）的应用

#include <iostream>
using namespace std;
const int N=400001;
string s;
int p[N],ans[N],ls,i,j,temp;
int main()
{
	while (cin>>s){
		ls=s.size();
		j=-1; p[0]=-1;
		for (i=1;i<ls;++i){
			while (j>-1 && s[i]!=s[j+1]) j=p[j];
			if (s[i]==s[j+1]) j++;
			p[i]=j;
		}
		
		ans[0]=ls-1;
		j=0; i=ls-1;
		while (p[i]>-1){
			ans[++j]=p[i];
			i=p[i];
		}
		for (i=j;i;i--)
			cout<<ans[i]+1<<' ';
		cout<<ans[0]+1<<endl;
	}
	return 0;
} 

kdwycz的网站：  http://kdwycz.com/

kdwyz的刷题空间：http://blog.csdn.net/kdwycz