poj 2752 Seek the Name, Seek the Fame 【在原串中 找所有既是原串前缀又是原串后缀的子串长度】
来源:互联网 发布:中国印度边境冲突 知乎 编辑:程序博客网 时间:2024/06/05 17:12
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14150 Accepted: 7046
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
题意:给你一个字符串,让你求出 所有既是该串前缀又是该串后缀的子串长度。并按升序输出长度。
如下:
a b a b c a b a b a b a b c a b a b对应f[]数组0 0 1 2 0 1 2 3 4 3 4 3 4 5 6 7 8 9由f[9] - > f[f[9]] - > f[f[f[9]]] -> f[] = 0 终止 过程中的f[]值全是合法解。思路:由失配数组f[],从字符串长度len 将f[len] 向前递推到 f[i]为0,在这个过程中所有非0的f[]值均是满足题意的子串长度。
#include <cstdio>#include <cstring>#include <algorithm>#define MAXN 400000+100using namespace std;int f[MAXN];char P[MAXN];int rec[MAXN];int len;void getfail(){f[0] = f[1] = 0;for(int i = 1; i < len; i++){int j = f[i];while(j && P[i] != P[j])j = f[j];f[i+1] = P[i] == P[j] ? j + 1 : 0;}}int main(){while(scanf("%s", P) != EOF){len = strlen(P);getfail();int k = 0;for(int i = len; f[i]; i = f[i])rec[k++] = f[i];for(int i = k-1; i >= 0; i--)printf("%d ", rec[i]);printf("%d\n", len);}return 0;}
1 0
- poj 2752 Seek the Name, Seek the Fame 【在原串中 找所有既是原串前缀又是原串后缀的子串长度】
- 所有既是前缀又是后缀的子串 KMP POJ 2752 Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame 【既是前缀又是后缀的子串】
- poj 2752 Seek the Name, Seek the Fame(找出所有前缀等于后缀的位置)
- 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(前后缀相同的位数)
- POJ 2752 Seek the Name, Seek the Fame [前后缀相同的KMP]
- poj seek the name,seek the fame
- poj---Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame POJ
- Seek the Name, Seek the Fame POJ
- POJ 2752 Seek the Name, Seekthe Fame(KMP:后缀与前缀)
- POJ-2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame(KMP)
- POJ 2752--Seek the Name, Seek the Fame (next)
- POJ:2752Seek the Name, Seek the Fame
- POJ - 2155 Matrix (二维树状数组 + 区间修改 + 单点求值 或者 二维线段树 + 区间更新 + 单点求值)
- C#高级编程----反射的小结
- 线程的三种创建方法
- 基本命令(按学习进度随机添加)
- ORM进阶之 ORM简介
- poj 2752 Seek the Name, Seek the Fame 【在原串中 找所有既是原串前缀又是原串后缀的子串长度】
- POj2516 Minimum Cost 最小费用最大流
- HDOJ Zipper (DFS)
- style-visibility
- java 深入解析FileInputStream和FileOutputStream
- java 序列化与反序列化
- 杭电 2087 剪花布条 kmp水题
- c++/c中流的概念
- UVa 10806 Dijkstra, Dijkstra (无向图+最小费用最大流+最短路:)