Seek the Name, Seek the Fame
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:)
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.
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题目大意:给出一个字符串,找出既是它前缀又是它后缀的所有子串的长度。
解题思路:考察对kmp算法及next数组的理解,求出给出字符串的next数组,递归打印len,next[len],next[next[len]]......即可。
代码如下:
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define EPS 1e-6
#define INF INT_MAX / 10
#define LL long long
#define MOD 100000000
#define PI acos(-1.0)
const int maxs = 400005;
char s[maxs];
int next[maxs];
int lens;
void get_next()
{
memset(next,-1,sizeof(next));
next[1] = 0;
for(int i = 2,j = 0;i <= lens;i++){
while(j > 0 && s[j + 1] != s[i])
j = next[j];
if(s[j + 1] == s[i])
j += 1;
next[i] = j;
}
}
void print(int x)
{
if(x == 0)
return ;
int temp = x;
temp = next[x];
print(temp);
printf("%d",x);
if(x != lens)
printf(" ");
}
int main()
{
while(scanf("%s",s + 1) != EOF){
lens = strlen(s + 1);
get_next();
print(lens);
printf("\n");
}
return 0;
}