POJ 2752 Seek the Name, Seek the Fame (KMP)
来源:互联网 发布:滨州行知中学电话 编辑:程序博客网 时间:2024/06/08 08:50
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:)
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.
For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.
ababcababababcababaaaaa
2 4 9 181 2 3 4 5
【AC代码】
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<stack>using namespace std;const int N=400005;int next_t[N];char s[N];void get_next(int n){ int i=0,k=-1; next_t[0]=-1; while(i<n) { while(k!=-1 && s[i]!=s[k]) k=next_t[k]; i++; k++; next_t[i]=k; }}void print(int n){ stack<int> q; while(!q.empty()) q.pop(); int k=next_t[n]; while(k>0) { q.push(k); k=next_t[k]; } while(!q.empty()) { printf("%d ",q.top()); q.pop(); }}int main(){ while(gets(s)) { int len=strlen(s); get_next(len); print(len); printf("%d\n",len); } return 0;}
阅读全文
0 0
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- poj 2752 Seek the Name, Seek the Fame(KMP)
- POJ-2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame(kmp)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame (KMP)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame (kmp)
- poj 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame(KMP)
- POJ-2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame (KMP)
- poj 2752Seek the Name,Seek the Fame(KMP)
- POJ 2752 Seek the Name, Seek the Fame (KMP)
- POJ 2752 Seek the Name, Seek the Fame (kmp)
- poj 2752 Seek the Name, Seek the Fame(KMP)
- Application Programming Interfaces -- 1
- hdu 5703 Desert 水题
- 一键读取Txt、Excel等表格配置【源码+原理】
- HDU-6126 Give out candies(最小割)
- lintcode --最小路径和
- POJ 2752 Seek the Name, Seek the Fame (KMP)
- mongoDB 安装和启动
- 1.16 C# 委托(下)
- hdu 3530 Subsequence(单调队列)
- Origin图中插入另一张jpg图
- slf4j 和 log4j合用的(Maven)配置
- 解析xml文件
- 深度学习---Python OS模块命令
- http://blog.csdn.net/wency935486/article/details/73604574