Seek the Name, Seek the Fame
来源:互联网 发布:php手机网页开发 编辑:程序博客网 时间:2024/06/01 08:04
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20647 Accepted: 10768
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
题意要求的找出满足既是字符串的s的前缀又是后缀的字串输出该字串的长度。
#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;#define MAXN 400010int kk;int mark;char pattern[MAXN];int next[MAXN];int a[1000000];/*求出next数组*/void getNext(){ int len = strlen(pattern); next[0] = next[1] = 0; for(int i = 1 ; i < len ; i++) { int j = next[i]; while(j && pattern[i] != pattern[j]) j = next[j]; next[i+1] = pattern[i] == pattern[j] ? j+1 : 0; }}/*递归输出*/void dfs(int len){ if(len==0) return ; a[kk]=len; kk++; dfs(next[len]);}int main(){ while(scanf("%s" , pattern) != EOF) { kk=0; getNext(); int len = strlen(pattern); mark = 0; dfs(len); for(int i=kk-1;i>=0;i--) { printf("%d",a[i]); if(i>0) printf(" "); } printf("\n"); } 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
- XYZZY HDU
- xilinx 高速收发器Serdes深入研究
- ELK 搭建 (一)
- Unity实现幸运大转盘
- 8.25模拟赛
- Seek the Name, Seek the Fame
- js获取当前日期,并且转化为时间格式“yyyy-MM-dd HH:MM:SS”
- mybits执行insert操作时,插入的对象含有其他对象时,外键如何插入
- PAT乙级1043. 输出PATest(20)
- ServletRequest,HttpServletRequest ServletResponse,HttpServletResponse的区别:
- 启动apache遇到错误:httpd: Could not reliably determine the server's fully qualified domain name
- 随服务器一起启动的几种方法
- 性能测试分析方法及要点
- 返回手机当前手机所有应用相关信息