poj 2752Seek the Name, Seek the Fame 【kmp】
来源:互联网 发布:定时提醒软件 绿色 编辑:程序博客网 时间:2024/05/29 18:44
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14154 Accepted: 7049
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
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
分析:
意思就是把next数组的数字从小到大输出。
代码:
#include<cstdio>#include<cstring>const int max= 400400;char str[max];int next[max];int len;int gg[max];void kmp(){int i=0,j=-1;next[0]=-1;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 dd=0; len=strlen(str);kmp();for(int i=len;next[i]!=-1;i=next[i])gg[dd++]=i;printf("%d",gg[dd-1]);for(int i=dd-2;i>=0;i--)printf(" %d",gg[i]);printf("\n");}return 0;}
0 0
- poj 2752 Seek the Name, Seek the Fame(KMP)
- poj 2752 Seek the Name, Seek the Fame---kmp
- POJ 2752 Seek the Name, Seek the Fame KMP
- [poj 2752] Seek the Name, Seek the Fame[KMP]
- poj 2752 Seek the Name, Seek the Fame (KMP)
- POJ 2752 Seek the Name, Seek the Fame (KMP)
- KMP poj 2752 Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame KMP
- poj 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame / KMP
- poj 2752 Seek the Name, Seek the Fame(KMP)
- Seek the Name, Seek the Fame - POJ 2752 KMP
- poj 2752 Seek the Name, Seek the Fame KMP
- poj 2752 Seek the Name, Seek the Fame,KMP
- poj 2752 Seek the Name, Seek the Fame(数据结构:KMP)
- POJ 2752 Seek the Name, Seek the Fame KMP题解
- POJ--2752--Seek the Name, Seek the Fame【KMP】
- C++基础---函数的返回类型
- STM32F4——NVIC中断优先级及外部中断
- HDU 5354 Bipartite Graph[cdq+并查集]
- POJ 2406 Power Strings(KMP 找最短循环节)
- CString转System::String ^应用实例
- poj 2752Seek the Name, Seek the Fame 【kmp】
- hibernate一对一,一对多,多对一,多对多关系映射与级联
- 我的金工实习心得(一):预热
- 线程sleep和yield的区别
- C++ 中的封装、继承
- 今天的考试
- 【动态树问题】LCT学习笔记
- UIFont管理文字形态
- Java 通过反射的方式应用