POJ2752-Seek the Name, Seek the Fame
来源:互联网 发布:琴岛 海尔 动画 知乎 编辑:程序博客网 时间:2024/06/05 08:06
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17408 Accepted: 8916
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
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
#include <iostream>#include <stdio.h>#include <queue>#include <cstring>#include <stack>using namespace std;char a[1000009];int nt[1000009];int n;void get_next(){ nt[0]=-1; for(int i=0; i<n; i++) { int k=nt[i]; while(k>=0&&a[i]!=a[k]) k=nt[k]; nt[i+1]=k+1; }}int main(){ while(~scanf("%s",a)) { n=strlen(a); get_next(); int x=n; stack<int>s; while(nt[x]>0) { x=nt[x]; s.push(x); } while(!s.empty()) { printf("%d ",s.top()); s.pop(); } printf("%d\n",n); } return 0;}
0 0
- POJ2752 Seek the Name, Seek the Fame
- POJ2752:Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752 seek the name seek the fame
- poj2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752-Seek the Name, Seek the Fame
- poj2752 Seek the Name,Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752 seek the name,seek the fame
- POJ2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame
- POJ2752-Seek the Name, Seek the Fame
- [POJ2752] Seek the Name,Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- 【POJ2752】seek the name,seek the fame
- Android之getCacheDir()和getFilesDir()方法区别
- UVa - 1585 - Score
- 个人环保意识社会调查新闻稿
- 安装Anaconda
- 【JAVA】多线程网络通信---聊天室
- POJ2752-Seek the Name, Seek the Fame
- modelstate查看错误字段的信息
- Activity的四种启动模式的介绍及其应用场景
- ucos_ii中的任务(1)
- 数据库的优点
- UVA10382 Watering Grass (贪心)
- 接口和抽象类
- Swing(一):JFrame框架窗体
- Android PullToRefresh下拉刷新,上拉加载的使用详解(转)