Seek the Name, Seek the Fame
来源:互联网 发布:美国网络存储公司 编辑:程序博客网 时间:2024/05/16 00:43
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14103 Accepted: 7016
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
该题的题意是这样的,给若干个字符串,判断该字符串前n个字符和后n个字符是否相同,相同并按按从小到大的顺序输出n。
如果还有点困惑可以看一下这个链接有大神做的解题报告点击打开链接
#include<stdio.h>#include<string.h>char a[401000];int p[401000];int c[400100];int len;void kmp(){int i,j;i=0;j=-1;p[0]=-1;while(i<len){if(j==-1||a[i]==a[j]){i++;j++;p[i]=j;}else j=p[j];}}int main(){while(scanf("%s",a)!=EOF){len=strlen(a);kmp();int i,j,k=0;for(i=len;p[i]!=-1;i=p[i])c[k++]=i;printf("%d ",c[k-1]);for(j=k-2;j>=0;j--)printf("%d ",c[j]);printf("\n");}}
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
- 蓝牙的RSSI转换为信号强度百分百
- (素材源码)swanzhu学IOS(三)打飞机
- YTU 2892 免费看电影 贪心
- POJ 1001(Exponentiation)
- Linux 下面安装redis
- Seek the Name, Seek the Fame
- UVA-11000 Bee-蜜蜂繁殖
- 【XML】视频总结
- uvalive 3616
- java Math.floor,Math.ceil,Math.rint,Math.round用法详解
- POJ-2013 Symmetric Order-对称排列人名
- 验证邮箱是否存在原理
- POJ - 2155 Matrix (二维树状数组 + 区间修改 + 单点求值 或者 二维线段树 + 区间更新 + 单点求值)
- C#高级编程----反射的小结