poj 2752

最新推荐文章于 2019-08-13 12:18:36 发布

cugbbaoge

最新推荐文章于 2019-08-13 12:18:36 发布

阅读量615

点赞数

CC 4.0 BY-SA版权

分类专栏： acm 文章标签： poj baoge

本文链接：https://blog.csdn.net/cugbbaoge/article/details/9383831

acm 专栏收录该内容

221 篇文章

订阅专栏

Seek the Name, Seek the Fame

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 9706		Accepted: 4651

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

本来没思路的，然后在ACM吧的群里水了一下，有大神发我一链接：http://chaoswork.com/blog/2011/06/14/kmp%E7%AE%97%E6%B3%95%E5%B0%8F%E7%BB%93/

读了之后，受益颇深，对next值理解更深了，其中最关键的一句话：“ i之前的一段字符和next[i]之前的一段字符是相同的”

之后思路瞬间有了，哗哗的，nice，此等好文章建议都读读

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char s[400005];
int next[400005];
int ans[400005];
int l;
int num;
void getnext()
{
    int j=0,k=-1;
    next[0]=-1;
    while(j<l)
    {
        if(k==-1||s[j]==s[k])
        {
            next[++j]=++k;
        }
        else k=next[k];
    }
}
int main()
{
    while(scanf("%s",&s)!=EOF)
    {
        l=strlen(s);
        getnext();
        ans[0]=l;
        int k=l;
        num=0;
        while(next[k]!=0)
        {
            k=next[k];
            ans[++num]=k;
        }
        cout<<ans[num];
        for(int i=num-1;i>=0;i--)cout<<" "<<ans[i];
        cout<<endl;
    }
    return 0;
}