POJ2752[Seek the Name, Seek the Fame] kmp
来源:互联网 发布:js在字符串中查找字符 编辑:程序博客网 时间:2024/05/13 13:13
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
solution: kmp+ next数组的性质
#include <cstdio>#include <iostream>#include <cstring>using namespace std;int nxt[400007], len;char t[400007];void get_next(){ int i=0, j=-1; nxt[0]=-1; while( i<len ){ if ( j==-1||t[i]==t[j] )i++, j++, nxt[i]=j ; else j=nxt[j]; }}void pt( int n ){ if( nxt[n]>0 ) { pt(nxt[n]); printf( "%d ", nxt[n]); }}int main(){ while( ~scanf("%s", t ) ){ len=strlen(t); get_next(); pt(len); printf( "%d", len); printf("\n"); }}
- 【KMP】 poj2752 Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame--------KMP
- poj2752 Seek the Name, Seek the Fame KMP
- POJ2752 Seek the Name, Seek the Fame 【KMP】
- POJ2752 Seek the Name, Seek the Fame KMP算法
- POJ2752 Seek the Name, Seek the Fame【KMP】
- POJ2752 Seek the Name, Seek the Fame(KMP)
- POJ2752 Seek the Name, Seek the Fame(kmp)
- 【poj2752】Seek the Name, Seek the Fame(KMP)
- 【poj2752】Seek the Name, Seek the Fame KMP
- POJ2752 Seek the Name, Seek the Fame KMP
- poj2752 Seek the Name, Seek the Fame (kmp)
- POJ2752 Seek the Name, Seek the Fame KMP应用
- kmp算法 poj2752 Seek the Name, Seek the Fame
- 【POJ2752】Seek the Name, Seek the Fame-KMP思想
- kmp杂题3 poj2752 Seek the Name, Seek the Fame
- 【POJ2752】Seek the Name, Seek the Fame(KMP)
- poj2752 Seek the Name, Seek the Fame(KMP)
- 剑指offer:变态跳台阶
- 圈复杂度
- Spring Transaction详解
- 聊聊Dubbox(三):架构原理
- vim使用基础(二)
- POJ2752[Seek the Name, Seek the Fame] kmp
- Linux文件系统管理
- 数组和链表的区别
- android最近任务列表,删除某个应用操作
- Monkey 随机脚本工具编写
- 装饰设计模式之DataSource包装
- 浅谈UML---时序图
- Hibernate关系映射---双向多对多增删查改实例
- Android 从MVP说起