| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 20198 | Accepted: 10515 |
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 这就是kmp中的next数组组的一个完美的应用
1 #include <iostream>
2 #include <cstdio>
3 #include <cstring>
4 #include <set>
5 #define N 400005
6 #define mem(a) memset(a,0,sizeof(a))
7 using namespace std;
8 char s[N];
9 int Next[N];
10 int f[N];
11 void get_Next(){
12 int slen=strlen(s);
13 int i=0;
14 int j=-1;
15 Next[0]=-1;
16 while(i<slen){
17 if(j==-1||s[i]==s[j]){
18 i++;j++;
19 Next[i]=j;
20 }else{
21 j=Next[j];
22 }
23 }
24 }
25 int main(){
26 while(scanf("%s",s)!=EOF){
27 get_Next();
28 int slen=strlen(s);
29 int i=slen;
30 int t=0;
31 while(i){
32 f[t++]=i;
33 i=Next[i];
34 }
35 for(int j=t-1;j>=0;j--){
36 cout<<f[j]<<" ";
37 }
38 cout<<endl;
39 }
40 return 0;
41 }