POJ 2752 Seek the Name, Seek the Fame
来源:互联网 发布:电脑测温软件 编辑:程序博客网 时间:2024/05/21 11:25
Language:
Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14560 Accepted: 7287
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
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
#include <cstdio>#include <cstring>#include <stack>using namespace std;const int N = 400010;char str[N];int next[N];void get_next() {int i = 0, j = -1;next[i] = j;while (str[i]) {if (j == -1 || str[i] == str[j])next[++i] = ++j;elsej = next[j];}}int main() {while (~scanf("%s", str)) {get_next();int len = strlen(str);stack<int> stk;stk.push(len);while (next[len]) {stk.push(next[len]);len = next[len];}while (!stk.empty()) {printf("%d ", stk.top());stk.pop();}puts("");}return 0;}
0 0
- 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, 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 2752 - Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- POJ-2752-Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame
- poj 2752 Seek the Name, Seek the Fame
- 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
- C++Primer第五版 第1章 开始(练习解答)
- POJ - 2421 Constructing Roads(最小生成树简单题)
- HDOJ 2639 Bone Collector II(01||第K大背包)
- LeetCode3——Longest Substring Without Repeating Characters
- overlapped 结构
- POJ 2752 Seek the Name, Seek the Fame
- 领域驱动设计的优点
- RCNN & SPP-net & Fast-RCNN & Faster-RCNN
- COCI2014 COCI
- spring mvc配置完后实现下载功能
- LeetCode 3 最大不重复子串
- MVC,MVP,MVVM框架剖析
- 异常处理
- 整合docker 和 jenkins