Seek the Name, Seek the Fame (KMP&&哈希)

  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

题意:
对于一个字符串s,找出所有相同的前缀后缀长度. 

KMP写法

KMP 的next数组的运用（改进前），如果next数组中next[ i ]= k 正值，那么就代表这从 “0 ~ i-1”位置的子串的前缀后缀相同的最大长度为k，并且k代表着与当前后缀最大匹配的前缀位置。

 

 

	0	1	2	3	4	5	6	7	8	9	10	11	12
字符串	a	a	b	a	a	b	a	a	b	a	a	b
next [ ]	-1	0	1	0	1	2	3	4	5	6	7	8	9

 

如表 next[12 ] = 9 , 9 所在位置的前缀 为 a a b a a b a a b，与后缀是最大匹配 ， next[ 9 ] = 6 ,6 所在位置的前缀 为 a a b a a b，仍然和后缀匹配，第二大匹配

next[ 6 ] = 3 , ，a a b, next[ 3 ] = 0，表明需要回溯到头再进行匹配。

因而通过前后缀重复次数的计数，以及next数组的调转，我们就能尽可能少的重复 重复位置的匹配。每次都能跳转到 前后缀最大公共的位置。

 

因而对于这个题，我们从最后的next[ len ]开始，不断地找 next[next[i]], 所找的前缀都和最后的后缀所匹配，所在位置的值就是前后缀相同的长度。全部累加就可以了。

另外还要加上满足条件的字符串本身。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm = 4e5 + 5;
char s[maxm];
int nex[maxm];
int ans[maxm],len;

void getnext()
{
	int j = 0;
	int i = 1;
	nex[0] = 0;
	while (i<len)
	{
		if (s[i]==s[j])
		{
			j++;
			nex[i] = j;
			i++;
		}
		else if (j==0)
			i++;
		else
			j = nex[j-1];
	}
}
void movenext()
{
	for (int i=len;i>0;i--)
		nex[i] = nex[i-1];
	nex[0] = -1;
}

int main()
{
	while(scanf("%s",s)!=EOF)
	{
		len = strlen(s);
		memset(nex,0,sizeof(nex));
		getnext();
		movenext();
		int cnt = 0;
		int temp = len;
		while (nex[temp]!=0)
		{
			ans[cnt++] = nex[temp];
			temp = nex[temp];
		}
		for (int i=cnt-1;i>=0;i--)
			printf("%d ",ans[i]);
		printf("%d\n",len);
	}
	return 0;
}

hash写法

一看就可以用字符串hash来搞,首位两端维护一个hash值,如果该hash值相等就说明字符串相同.

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm = 4e5 + 5;
const int p = 233;
typedef unsigned long long ull;
char s[maxm];
int main()
{
	while(scanf("%s",s)!=EOF)
	{
		int i,j,cnt = 0;
		int len = strlen(s);
		ull a = 0,b = 0,k = 1;
		int flg = 0;
		for (i=0,j=len-1;i<len;i++,j--)
		{
			a = a * p + s[i] - 'a' + 1;
			b = (s[j] - 'a' + 1) * k + b;
			if (a==b)
			{
				if (flg)
					printf(" ");
				printf("%d",i+1);
				flg = 1;
			}
			k *= p;
		}
		printf("\n");
	}
	return 0;
}