KMP 算法
2016-02-20 22:11
309 查看
POJ 2752
Seek the Name, Seek the Fame
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:)
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.
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
Sample Output
Seek the Name, Seek the Fame
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 15528 | Accepted: 7856 |
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:)
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.
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
ababcababababcabab aaaaa
Sample Output
2 4 9 18 1 2 3 4 5
<span style="font-size:14px;">#include <iostream> #include <cstdio> #include <cstring> using namespace std; int Next[400005]; char str[400005]; int ans[400005]; int cnt; int len; void getNext() { Next[0] = -1; int i = 0, j = -1; while (i < len) { if (j == -1 || str[i] == str[j]) { ++i; ++j; Next[i] = j; } else j = Next[j]; } } int main() { while (scanf("%s", str) != EOF) { len = strlen(str); getNext(); cnt = 0; int t = Next[len - 1]; while (t != -1) { if (str[t] == str[len - 1]) ans[cnt++] = t + 1; t = Next[t]; } for (int i = cnt - 1; i >= 0; --i) { printf("%d ", ans[i]); } printf("%d\n", len); } return 0; } </span>
相关文章推荐
- Docker pull 出现的 Server error: Status 0 while fetching image layer
- ARP协议的工作原理
- BestCoder Round #73 (div.2)(B)并查集
- Java [Leetcode 278]First Bad Version
- 韬晦术
- 构筑测试体系
- jquery easyui添加图标扩展
- OpenJudge百炼习题解答(C++)--题1936:全在其中
- C#里氏转换/is/as
- UVA_11090_GoingInCycle!!
- 关于async和await的一些误区实例详解
- 费用流解决最优匹配 PKU3686
- Markdown 编辑器集锦
- iOS-真机调试
- Java基础理解
- Android更改桌面应用程序launcher的两种方式
- LinkageError
- win 7 取得最高权限
- bzoj1006: [HNOI2008]神奇的国度
- hdoj 2033 人见人爱