seek the name,seek the same
来源:互联网 发布:开源crm java 源码 编辑:程序博客网 时间:2024/06/04 01:14
H - Seek the Name, Seek the Fame
Crawling in process...Crawling failedTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit
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#include <iostream>#include<cstdio>#include<string.h>using namespace std;#define maxn 1000001char s[maxn];int next[maxn],put[maxn];int main(){ while(~scanf("%s",s)) { int len=strlen(s); int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1||s[i]==s[j]) { i++; j++; next[i]=j; } else j=next[j]; } int ans=0; int t=len; while(next[t]>0) { put[ans++]= next[t]; t=next[t]; } for(int i=ans-1; i>=0; i--) printf("%d ",put[i]); printf("%d\n",len); } return 0;}
Sample Output
2 4 9 181 2 3 4 5
0 0
- seek the name,seek the same
- U - Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame(KMP)
- POJ2752 Seek the Name, Seek the Fame
- POJ2752:Seek the Name, Seek the Fame
- poj2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame(kmp)
- Seek the Name, Seek the Fame KMP
- POJ2752 Seek the Name, Seek the Fame
- poj_2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- poj2752 seek the name seek the fame
- poj2752 Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- Seek the Name, Seek the Fame
- POJ2752 Seek the Name, Seek the Fame
- POJ2572(Seek the Name, Seek the Fame)
- Mybatis使用
- android 组件ImageSwitch实例
- Solarized Colorscheme for IntelliJ IDEA
- 让bootstrap的carousel支持滑动滚屏
- python异常处理和断言
- seek the name,seek the same
- Android-GridView (Simpleadapter)
- leetcode 166: Fraction to Recurring Decimal
- JavaScript 中的闭包(closure)是什么鬼?
- android textview 字体不同颜色
- 网络地址转换
- 确定字符互异(Java)
- 当前插入的线段能完整覆盖存在的几条线段 树状数组 HDU 5372 Segment Game
- Quartz2D-二维绘图引擎 、自定义UI控件