POJ2752Seek the Name, Seek the Fame (KMP)
来源:互联网 发布:一个人根本做不起淘宝 编辑:程序博客网 时间:2024/06/05 15:31
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14132 Accepted: 7035
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
ababcababababcababaaaaa
Sample Output
2 4 9 181 2 3 4 5
//给你一个字符串,让你求它的前缀的长度,以及子串的前缀的长度
(全部)(18)ababcababababcabab
(前缀)(9)ababcabab (后缀)ababcabab
(前缀)(4)abab c (后缀) abab
(前缀)(2)ab (后缀)ab
#include<cstdio>#include<cstring>#define max 400000+10char str[max];int next[max],a[max],len;void Getp(){int i=0,j=-1;next[i]=j;while (i<len){if (j==-1||str[i]==str[j]){i++;j++;next[i]=j;}elsej=next[j];}}int main(){while (scanf ("%s",str)!=EOF){int k=0;len=strlen(str);Getp();for (int i=len;i!=0;){a[k++]=next[i];i=next[i];}for (int j=k-2;j>=0;--j)printf ("%d ",a[j]);printf ("%d\n",len);}return 0;}
0 0
- poj2752Seek the Name, Seek the Fame【kmp】
- POJ2752Seek the Name, Seek the Fame (KMP)
- POJ2752Seek the Name, Seek the Fame(KMP)
- poj2752Seek the Name, Seek the Fame
- poj2752Seek the Name, Seek the Fame
- poj2752Seek the Name, Seek the Fame
- poj2752Seek the Name, Seek the Fame(kmp简单变形,next数组)
- Seek the Name, Seek the Fame(KMP)
- Seek the Name, Seek the Fame(kmp)
- Seek the Name, Seek the Fame KMP
- kmp Seek the Name, Seek the Fame
- POJ_2752_Seek the Name, Seek the Fame【kmp】
- 2752 Seek the Name, Seek the Fame //KMP
- poj 2752 Seek the Name, Seek the Fame(KMP)
- (kmp) Seek the name, seek the fame(P2752)
- 【KMP】 poj2752 Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame--------KMP
- poj 2752 Seek the Name, Seek the Fame---kmp
- 自定义view之音量控制
- Contest 5 1002 MZL's xor【math】
- zookeeper简介
- Android之常见错误总结【入门版】
- java DES加密,解密 (一)
- POJ2752Seek the Name, Seek the Fame (KMP)
- 介绍几款网页数据抓取软件
- @昵称符号截取(最简单的字符串截取)二
- qt error: C2001: 常量中有换行符
- docker on spark
- [iOS]Xcode no visible @interface for XXX declares…
- 繞過linux Driver Vermagic檢查
- http://blog.csdn.net/lpdx111/article/details/7638147
- libopencv_shape.so.3.0: cannot open shared object file: No such file or directory 解决笔记