Seek the Name, Seek the Fame

时间:2019-01-18
本文章向大家介绍Seek the Name, Seek the Fame,主要包括Seek the Name, Seek the Fame使用实例、应用技巧、基本知识点总结和需要注意事项,具有一定的参考价值,需要的朋友可以参考一下。

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

思路:这题利用了F函数(next函数)的性质

所以只要生成F数组并进行递归就能解决

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
const int N=1000005;
int F[N];
char a[N];
void getF (char *P, int m)
{
    F[1]=0;
    for(int i=2;i<=m;i++)
    {
        int k=F[i-1];
        while(k&&P[k+1]!=P[i]) k=F[k];
        if(P[k+1]==P[i]) k++;
        F[i]=k;
    }
}
void txF(int n)
{
    if(F[n]==0) return ;
    else txF(F[n]);
    printf("%d ",F[n]);
}
int main()
{
    while(~scanf("%s",a+1))
    {
        int al=strlen(a+1);
        getF(a,al);
        txF(al);
        printf("%d\n",al);
    }
    return 0;
}