Seek the Name, Seek the Fame
来源:互联网 发布:产品设计所需软件 编辑:程序博客网 时间:2024/06/05 10:06
Seek the Name, Seek the Fame
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 5 Accepted Submission(s) : 3
Problem 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 5C语言程序代码#include<stdio.h>#include<string.h>char a[400010];int p[400010];int b[400010];int l;void getp(){ int i=0,j=-1; p[i]=j; while(i<l) { if(j==-1||a[i]==a[j]) { i++;j++; p[i]=j; } else j=p[j]; }}int main(){ while(gets(a)!=NULL) { l=strlen(a); getp(); int j=0,i=l; while(p[i]>0) { j++; b[j]=p[i]; i=p[i]; } for(i=j;i>0;i--) printf("%d ",b[i]); printf("%d\n",l); } return 0;}
0 0
- U - Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame(KMP)
- POJ2752 Seek the Name, Seek the Fame
- POJ2752:Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame(kmp)
- Seek the Name, Seek the Fame KMP
- POJ2752 Seek the Name, Seek the Fame
- poj_2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- poj2752 seek the name seek the fame
- poj2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- POJ2572(Seek the Name, Seek the Fame)
- poj2752-Seek the Name, Seek the Fame
- CLR via C# 读书笔记 1-2 创建线程的成本
- SEO搜索引擎正排索引和倒排索引的区别
- 枚举(java.long包中的常用类之一)
- xib中设置控件的边框以及圆角
- 未能加载文件或程序集“MySql.Web.v20, Version=6.9.4.0, Culture=neutral, PublicKeyToken=c5687fc88969c44d”或它的某一个依赖
- Seek the Name, Seek the Fame
- 搜索引擎与SEO的纽带——你应该知道的事:网络爬虫
- Java中以字符流形式操作文件中的编码问题
- 暑期学校ACM之旅
- C++ 记录程序运行时间
- 网站架构模式
- 欢迎使用CSDN-markdown编辑器
- ViewPager 入门三---详解四大函数
- Linux管线命令 - cut,grep,sort,uniq,wc,tee,tr,col,join,paste,expand,split,xargs