POJ2752 Seek the Name, Seek the Fame
来源:互联网 发布:数据的分散程度 编辑:程序博客网 时间:2024/06/05 04:26
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14203 Accepted: 7077
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
题意:找一个字符串中所有前缀和后缀相同的子串
#include <iostream>#include <stdio.h>#include <string>#include <cstring>#include <cmath>using namespace std;char s[1000009];int nt[1000009];int len;void getnext(){ int k=-1,j=0; nt[0]=-1; while(j<len) { if(k<0 || s[j]==s[k]) { j++; k++; nt[j]=k; } else k=nt[k]; }}int ans[400009];int main(){ while(~scanf("%s",s)) { len=strlen(s); getnext(); for(int i=0;i<=len;i++) cout<<nt[i]<<" "; cout<<endl; int cnt=0; ans[0]=len; for(int i=nt[len];i>0;i=nt[i])//next数组的性质。 ans[++cnt]=i; for(int i=cnt;i>0;i--) cout<<ans[i]<<" "; cout<<ans[0]<<endl; } return 0;}
1 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
- Volley使用时InterruptedIOException,NoConnectionError
- EventBus使用详解(一)——初步使用EventBus
- SVN基本用法
- maven 手动添加jar包到本地仓库和nexus
- 数据结构-循环链表(学习笔记)
- POJ2752 Seek the Name, Seek the Fame
- 详解Oracle的几种分页查询语句
- hdu 3081 Marriage Match II (二分+最大流+并查集)
- spring mvc 多文件上传
- Java 流缓冲区问题
- java Swing中JTextField自动补全功能例子
- 我的iOS开发之Objective-C第5、6天之Founcation
- android传感器使用规范(1)
- oracle中的sql%rowcount