Seek the Name, Seek the Fame KMP
来源:互联网 发布:全球域名注册量排名 编辑:程序博客网 时间:2024/06/05 00:09
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#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>using namespace std;char str[400010];int pre[400010];int ans[400010];int len;void predeal(){ int j=0;pre[1]=0; for(int i=2;i<=len;i++){ while(j>0&&str[j+1]!=str[i]) j=pre[j]; if(str[j+1]==str[i]) j++; pre[i]=j; }}int main(){ //freopen("in.in","r",stdin); while(~scanf("%s",str+1)) { len=strlen(str+1); predeal(); int ed=len; int st=0; ans[st++]=ed; while(pre[ed]>0) { ans[st++]=pre[ed]; ed=pre[ed]; } sort(ans,ans+st);st--; for(int i=0;i<st;i++) printf("%d " ,ans[i]); printf("%d\n",len); } return 0;}
0 0
- 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
- poj2752Seek the Name, Seek the Fame【kmp】
- POJ2752Seek the Name, Seek the Fame (KMP)
- 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
- POJ 2752 Seek the Name, Seek the Fame KMP
- pku 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)
- Java关键字介绍之final
- Git修改前一次提交的方法(特别注意保持Change-Id不变)
- poj1703(基于分组)
- RTL Layout Support
- PHP中的Array2String & String2Array
- Seek the Name, Seek the Fame KMP
- ubuntu Terminal 路径太长 vi 时出现字母
- Cracking the coding interview--Q11.1~Q11.6
- Ant打包工具介绍
- R2009b 版本安装后显示的错误
- dsa fas fas
- 历届奥斯卡最佳影片
- HDU - 2844 Coins
- 经验累积20140312