poj 2752 找到所有的公共前后缀
来源:互联网 发布:易到打车软件 编辑:程序博客网 时间:2024/06/08 10:00
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19251 Accepted: 9898
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
举个例子 abcabcabc nxet[9]的值为6
next[6]的值为3 sh说明前六个里前三个和后三个匹配 因为前六个和后六个匹配 所以前三个 和最后三个也匹配了!!!!!!11
next[3]的值为0 所以不停向下找就能找到所有的公共前后缀
#include <iostream>#include<cstdio>#include<cstring>using namespace std;char a[1000005];int n[1000005];void kmp(int len){ n[0]=-1; int k=-1; int j=0; while(j<=len) { if(k==-1||a[j]==a[k]) { k++; j++; n[j]=k; } else k=n[k]; }}void print(int len){ if(n[len]>0) //递归打印 先打了最小的 { print(n[len]); printf("%d ",n[len]); }}int main(){ while(scanf("%s",a)!=-1) { int len=strlen(a); kmp(len); print(len); printf("%d\n",len); } return 0;}
阅读全文
0 0
- poj 2752 找到所有的公共前后缀
- POJ 2752 -kmp求所有公共前后缀长度
- 【kmp算法next数组求解公共前后缀】Seek the Name, Seek the Fame POJ
- poj2752 求一个串所有的前后缀
- poj 2774求两个串的公共前缀 后缀数组
- 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(找出所有前缀等于后缀的位置)
- POJ 2752+KMP+利用next数组性质求出所有相同的前缀和后缀
- Acdream || 娜娜梦游仙境系列——诡异的钢琴(公共前后缀
- HDU4691用RMQ求所有字符串后缀的最长公共前缀
- POJ 3415 Common Substrings(后缀数组:后缀公共前缀个数)
- [HDU 2594]Simpsons’ Hidden Talents[kmp求公共前后缀]
- poj 3415 ( 后缀数组 长度不小于 k 的公共子串的个数)
- POJ 1226 Substrings (后缀数组 n个串的最长公共子串)
- poj 3294 后缀数组求至少在k个串中出现的公共子串
- poj 2774 求两字符串的最长公共子串 后缀数组
- 后缀数组(多个字符串的最长公共子串)—— POJ 3294
- 淘淘商城系列——分布式文件系统FastDFS
- T-SQL:用字符*显示一个三角形
- 一、简单工厂模式
- 字符串类型的转换之toString()示例
- PHP中刷新输出缓冲详解
- poj 2752 找到所有的公共前后缀
- SpringBoot-整合MyBatis
- Java关键字transient和volatile
- android广播机制
- java使用ResourceBundle访问资源文件(.properties文件)
- POJ1703 并查集
- HTTP状态码详解
- 消息中间件-activemq安全机制
- 【剑指offer-解题系列(36)】 数组中的逆序对