POJ 2752 Seek the Name, Seek the Fame
2015-10-29 22:04
393 查看
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 14761 | Accepted: 7407 |
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:)
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.
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
ababcababababcabab aaaaa
Sample Output
2 4 9 18 1 2 3 4 5
Source
POJ Monthly--2006.01.22,Zeyuan Zhu ---------------------------------------------- 贴代码,回味。。。。。#include <cstdio> using namespace std; const int N(4e5+5); char s ; int nt , ans ; int main(){ for(int ls, cnt; ~scanf("%s", s);){ for(int i=ls=1, k=0; s[i]; i++, ls++){ while(k&&s[k]!=s[i]) k=nt[k-1]; nt[i]=s[k]==s[i]?++k:k; } for(int i=(cnt=0,ls); i; ans[cnt++]=i, i=nt[i-1]); for(; cnt; printf("%d ", ans[--cnt])); puts(""); } }
代码有亮点
for(int i=(cnt=0,ls); i; ans[cnt++]=i, i=nt[i-1]);
相关文章推荐
- Swing创建带图标的右键弹出菜单
- 深入理解C语言的函数调用过程
- 排序算法 之 快速排序
- 在jQuery与Node之间创建跨域请求(Cross-Origin Resource Sharing (CORS) )
- poj 2349 Arctic Network 最小生成树第k大边-kruskal
- Java中常用字符串方法总结
- 1058. A+B in Hogwarts
- CUDA之内存
- hdoj1042(N!,大数乘)
- myeclipse的jre与安装的jre不同之处
- 保龄球计分算法
- 【LeetCode从零单刷】Symmetric Tree
- 最大子序列和
- poj1274二分匹配入门
- 学习C++,应该循序渐进看哪些书?
- vsftpd 匿名用户只读不写的原因
- 河南第八届省赛(最小换乘)(最短路径,DP)
- 突击计划
- [leetcode] Summary of Linked List (1)
- java 占位符 拼接字符串