首页 > 代码库 > 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
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 ababcababababcabab aaaaa Sample Output 2 4 9 18 1 2 3 4 5 Source POJ Monthly--2006.01.22,Zeyuan Zhu |
给你一个字符串，求所有前缀等于后缀的情况。
next数组的应用，KMP求出next数组，每次去掉next[i]到i的一段字符，剩余字串仍满足条件，直到找到头为止。
next[i]！=0的，都是模式串的前缀和后缀相同的字符数。
//3892K 547MS
#include<stdio.h>
#include<string.h>
#define M 10007
char pattern[400007];
int next[400007],m,ans[400007];
void pre(int len)
{
int i = 0, j = -1;
next[0] = -1;
while(i != len)
{
if(j == -1 || pattern[i] == pattern[j])
next[++i] = ++j;
else
j = next[j];
}
}
int main()
{
while(scanf("%s",pattern)!=EOF)
{
memset(ans,0,sizeof(ans));
memset(next,0,sizeof(next));
m=strlen(pattern);
pre(m);
int k=0;
for(int i=m; i!=0; )
{
ans[k++]=next[i];
i=next[i];
}
for(int i=k-2; i>=0; i--)
printf("%d ",ans[i]);
printf("%d\n",m);
}
return 0;
}
POJ 2752 Seek the Name, Seek the Fame kmp失配函数next应用
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。