Seek the Name, Seek the Fame
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9783 | Accepted: 4693 |
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
ababcababababcabab aaaaa
Sample Output
2 4 9 18 1 2 3 4 5
Source
POJ Monthly--2006.01.22,Zeyuan Zhu
题意:找出既是该字符串的前缀,也是字符串的后缀的子串的长度
题解:灵活运用KMP值,用栈保存数据。熟知next的值代表该位置i前面的next【i】-1个字符和前缀的next【i】-1个字符相同,则迭代相等传递即可证明每次i=next【i+1】-1就是一个既是前缀也是后缀的子串
#include<stdio.h>
#include<string.h>
char s[400005];
int next[400005],sta[400005],all;
void get_next()
{
int len=strlen(s+1),i=1,j;
next[1]=j=0;
while(i<=len)
{
if(j==0||s[i]==s[j]) next[++i]=++j;
else j=next[j];
}
}
void solve()
{
int len=strlen(s+1),i;
all=0,sta[all++]=len;
for(i=len;i>1;)
{
if(next[i+1]>1) sta[all++]=next[i+1]-1;
i=next[i+1]-1;
}
}
void print()
{
int i;
for(i=all-1;i>0;i--) printf("%d ",sta[i]);
printf("%d\n",sta[i]);
}
int main()
{
while(scanf("%s",&s[1])>0)
{
get_next();
solve();
print();
}
return 0;
}