POJ 2752 Seek the Name, Seek the Fame
来源:互联网 发布:mac怎么输入emoji 编辑:程序博客网 时间:2024/04/28 16:50
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 <iostream>#include <cstring>#define N 400000using namespace std;char a[N];int next[N];int ans[N];void get_next(){ int len=strlen(a); int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1||a[i]==a[j]) { i++; j++; next[i]=j; } else j=next[j]; }}int main(){ int len; while(cin>>a) { len=strlen(a); get_next(); int n=0,i=len; ans[0]=len; while(next[i]>0) { ans[++n]=next[i]; i=next[i]; } for(int i=n;i>0;i--) cout<<ans[i]<<" "; cout<<ans[0]<<endl; } return 0;}
0 0
- poj seek the name,seek the fame
- poj---Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame POJ
- Seek the Name, Seek the Fame POJ
- POJ-2752 Seek the Name, Seek the Fame
- 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 (next)
- POJ:2752Seek the Name, Seek the Fame
- POJ 2752 - Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- POJ-2752-Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame---kmp
- 第7周作业1-循环大战
- Android多线程,让耗时的操作去后台,handler传递对象图片下载
- 32位与64位 CPU、编译器、操作系统与应用程序的区别
- MYSQL、SQL Server、Oracle数据库排序空值null问题及其解决办法
- 归并排序
- POJ 2752 Seek the Name, Seek the Fame
- curl 参数
- http请求的过程
- 阿七婆
- js
- Log4J的配置
- JSON(一种轻量级的数据交换格式)格式化工具
- mysql为数据库分配用户
- MCF52259 PLL & GPIO