POJ 2752 Seek the Name, Seek the Fame（kmp数组）

题目链接：http://poj.org/problem?id=2752点击打开链接

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 21804		Accepted: 11407

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

求前后缀相同即是next数组的运用 

从最后一位的next不断枚举

只要next【i】不为0即说明存在这种情况

#include <stdio.h>
#include <string.h>
#include <vector>
#include <algorithm>
using namespace std;
char t[1111111];
int n,m;
int nnext[1111111];
void getnext()
{
	int i=0,j=-1;
	nnext[0]=-1;
	while(i<n)
	{
		if(j==-1||t[i]==t[j])
		{
			i++;
			j++;
			nnext[i]=j;

		}
		else
		{
			j=nnext[j];
		}
	}
}
int  main()
{
	while(scanf("%s",&t)!=EOF)
	{
		n=strlen(t);
		getnext();
		vector<int > s;
		s.push_back(n);
		int mid=nnext[n];
		while(mid!=0)
		{
			s.push_back(mid);
			mid=nnext[mid];
		}
		reverse(s.begin(),s.end());
		for(int i=0;i<s.size();i++)
		{
			printf("%d ",s[i]);

		}printf("\n");
	}
}