poj2752Seek the Name, Seek the Fame

时间：2015-04-03 12:54:34 阅读：132 评论：0 收藏：0 [点我收藏+]

标签：

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<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<set>
using namespace std;

char s[410000];
int next[410000],l;
void f(int t)
{
    if(t == 0) return;
    f(next[t]);
    if(t!=l)printf("%d ",t);
    else printf("%d\n",t);
}


int main()
{
    int i,j,k;
    while(scanf("%s",s+1)!=EOF)
    {
        l = strlen(s+1);
        next[1] = 0;
        for(i = 2;i<l+1;i++)
        {
            int t = next[i-1];
            while(t&&s[i]!=s[t+1]) t = next[t];
            if(s[i] == s[t+1]) t++;
            next[i] = t;
        }
        f(l);
    }
    return 0;
}

poj2752Seek the Name, Seek the Fame

标签：

原文地址：http://www.cnblogs.com/wos1239/p/4389481.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行