Seek the Name, Seek the Fame next数组的应用
来源:互联网 发布:iroha mini知乎 编辑:程序博客网 时间:2024/05/17 01:14
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
题目大意:求一个字符串前后缀相等的长度。很明显,最大长度是next[len],然后不断的取next就得到了全部前后缀相等的长度。在运行时发现我的next数组含义有点不一样,因为我比较的是s[j + 1] == s[i],所以next[j]是坐标,加一后才是长度
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>using namespace std;const int N = 4e5 + 3;char s[N];int next[N];void GetNext(){ int j = -1, len = strlen(s); next[0] = -1; for(int i = 1; i < len; i++) { while(j != -1 && s[j + 1] != s[i]) j = next[j]; if(s[j + 1] == s[i]) j++; next[i] = j; }}int main(){ while(~scanf("%s", s)) { GetNext(); int i = strlen(s) - 1, k = 0, m[N]; while(next[i] != -1) { m[k++] = next[i]; i = next[i]; } for(i = k - 1; i >= 0; i--) printf("%d ", m[i] + 1); printf("%d\n", strlen(s)); } return 0;}
阅读全文
0 0
- Seek the Name, Seek the Fame next数组的应用
- POJ2752 Seek the Name, Seek the Fame next数组应用
- POJ 2752 Seek the Name, Seek the Fame(KMP,next数组的应用)
- POJ2752 Seek the Name, Seek the Fame KMP-next数组的应用
- Seek the Name, Seek the Fame POJ 2752【KMP next数组的应用】
- POJ 2752 Seek the Name, Seek the Fame(next数组的应用)
- POJ-2752 Seek the Name, Seek the Fame(kmp中next数组的应用)
- POJ 2752: Seek the Name, Seek the Fame(简单KMP-NEXT数组的应用)
- POJ 2752 Seek the Name, Seek the Fame(KMP next数组的应用)
- POJ 2752 Seek the Name, Seek the Fame(KMP next数组应用)
- Seek the Name, Seek the Fame(KMP之next数组应用)
- POJ 2752 Seek the Name, Seek the Fame(next数组的理解)
- POJ 2752 Seek the Name, Seek the Fame(KMP的next数组)
- Seek the Name, Seek the Fame +poj+next数组的理解
- poj2752 Seek the Name, Seek the Fame(next数组的运用)
- POJ - 2752 Seek the Name, Seek the Fame(KMP next数组的理解)
- Seek the Name, Seek the Fame(KMP算法之next数组的深入理解实例)
- POJ 2752 Seek the Name, Seek the Fame(KMP+next数组的运用)
- Atom 显示右侧的行数
- Linux命令缩写大全(转)
- bzoj2287【POJ Challenge】消失之物 背包dp
- python网络爬虫文档读取-纯文本读取
- linux查找刷卡器输入设备
- Seek the Name, Seek the Fame next数组的应用
- dubbo源码分析-consumer端2-创建注册中心
- 小型的js添加留言
- 存储一万亿张图片,需要怎样的架构?
- 2017.09.08
- oracle查看允许的最大连接数和当前连接数
- JSON字符串和java对象的互转【json-lib】
- 二分查找
- 《分布式计算、云计算与大数据》笔记