poj2752之KMP_next的含义
2013-07-09 19:03
253 查看
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
考察是否理解next的含义
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9613 | Accepted: 4602 |
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
考察是否理解next的含义
#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<string> #include<queue> #include<algorithm> #include<map> #include<iomanip> #define INF 99999999 using namespace std; const int MAX=400000+10; char s[MAX]; int next[MAX],x[MAX]; void get_next(char *a){ int i=-1,j=0,len=strlen(a); next[0]=-1; while(j<len){ if(i == -1 || a[i] == a[j])next[++j]=++i; else i=next[i]; } return; } int main(){ while(cin>>s){ get_next(s); int k=0,len=strlen(s); while(next[len]>0){ x[++k]=next[len]; len=next[len]; } for(int i=k;i>=1;--i)cout<<x[i]<<' '; cout<<strlen(s)<<endl; } return 0; }
相关文章推荐
- POJ2752【KMP-next数组含义】
- poj 2752 KMP(next数组的运用)
- POJ 2752 KMP中next数组的理解
- poj2752—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数组)
- [KMP-NEXT数组性质]POJ 2752 Seek the Name, Seek the Fame
- POJ 2752 Seek the Name, Seek the Fame(KMP next数组应用)
- poj2752 KMP的next[]函数的理解 或者 扩展的KMP
- poj2752_Seek the Name,Seek the Fame_KMP(next数组定义的应用)
- poj 2752 kmp(next数组模板)
- Seek the Name, Seek the Fame POJ - 2752 (KMP next数组 的 其他用法)
- POJ2752 KMP中next数组的应用
- poj 2752 KMP的next数组应用(prefix-suffix string)
- POJ 2752: S 4000 eek the Name, Seek the Fame(简单KMP-NEXT数组的应用)
- POJ 2752、2406、1961 KMP的next[](或p[])简单应用
- POJ - 2752 Seek the Name, Seek the Fame(KMP中对next数组的前缀后缀匹配应用)
- POJ 2752+KMP+利用next数组性质求出所有相同的前缀和后缀
- 【POJ 2752 KMP之next】