poj-------------(2752)Seek the Name, Seek the Fame(kmp)

Seek the Name, Seek the Fame

Time Limit: 2000MS

Memory Limit: 65536K

Total Submissions: 11831

Accepted: 5796

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

代码:

 1     #include<iostream>
 2     #include<cstring>
 3     #include<cstdlib>
 4     #include<cstdio>
 5     using namespace std;
 6     const int maxn= 400050;
 7     int next[maxn];
 8     int ans[maxn];
 9     char str[maxn];
10     int main()
11     {
12       int i,j;
13       while(scanf("%s",str)!=EOF&&*str!='.')
14       {
15           j=-1;
16           i=0;
17           next[i]=-1;
18           int len=strlen(str);
19           while(i<len)
20           {
21               if(j==-1||str[i]==str[j])
22               {
23                   i++;
24                   j++;
25                  next[i]=j;
26               }
27               else j=next[j];
28           }
29           /*
30            麻袋,搞得我好郁闷,没有看清楚,怎么也不懂怎么构造。原来要找的是前缀和后缀相同的串
31           */
32           i=len;
33           int cnt=0;
34           while(i>0)
35           {
36            // printf("%d\n",i);
37            ans[cnt++]=i;
38            i=next[i];
39           }
40           for(i=cnt-1;i>0;i--)
41             printf("%d ",ans[i]);
42             printf("%d\n",ans[0]);
43       }
44         return 0;
45     }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

扫码关注云+社区

领取腾讯云代金券