2752 Seek the Name, Seek the Fame //KMP

最新推荐文章于 2020-07-15 10:41:37 发布

原创最新推荐文章于 2020-07-15 10:41:37 发布

· 537 阅读

0 ·

版权

文章标签：

#string #output #algorithm #integer #numbers #each

ACM_数据结构专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种用于寻找字符串中既是前缀也是后缀的子串算法，并提供了一个具体的实现示例。该算法适用于帮助解决一类特定的问题，例如为新生儿起名等有趣的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 5243		Accepted: 2308

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

#include<stdio.h>
#include<string.h>
char s[400001];
int l;
int p[400001];
int a[400001];
void init()
{
    int j;
    p[1]=0;
    for(int i=2;i<=l;i++)
    {
        j=p[i-1];
        while(j>0&&s[j+1]!=s[i]) j=p[j];
        if(s[j+1]==s[i]) j++;
        p[i]=j;
    }
}
int main()
{
    while(scanf("%s",s+1)!=EOF)
    {
        s[0]='1';
        l=strlen(s)-1;
        init();
        int num=0;
        int j=l;
        while(j>0)
        {
            a[num++]=j;
            j=p[j];
        }
        for(int i=num-1;i>=0;i--)
        {
            if(i!=num-1) printf(" %d",a[i]);
            else printf("%d",a[i]);
        }
        printf("/n");
    }
    return 0;
}