POJ 2752 Seek the Name, Seek the Fame

最新推荐文章于 2021-12-13 14:38:22 发布

原创最新推荐文章于 2021-12-13 14:38:22 发布 · 2.3k 阅读

0 ·

CC 4.0 BY-SA版权

POJ 同时被 2 个专栏收录

69 篇文章

订阅专栏

KMP

19 篇文章

订阅专栏

本文介绍了一种用于寻找字符串中可能的前后缀匹配的算法。通过递归使用next数组，可以找到给定字符串的所有可能前后缀长度，适用于解决特定类型的字符串匹配问题。

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

题目链接

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

用到了 $n e x t$ 数组的性质，假如 $n e x t [i]$ 数组表示当前匹配到的最长前后缀，那么 $n e x t [n e x t [i]]$ 就表示当前匹配到的最长前后缀的字符串的最长前后缀，所以可以通过递归得到答案，AC代码如下：

#include "cstdio"
#include "cstring"

using namespace std;
typedef long long ll;
const int N = 4e5 + 5;
int n[N];
int len;
char p[N];

void getnext() {
    int j = -1, i = 0;
    n[0] = -1;
    while (i < len) {
        if (j == -1 || p[i] == p[j]) {
            i++, j++;
            n[i] = j;
        } else j = n[j];
    }
}

void print(int x) {
    if (n[x] == 0) {
        printf("%d", x);
        return;
    }
    print(n[x]);
    printf(" %d", x);
}

int main() {
    while (~scanf("%s", p)) {
        len = strlen(p);
        memset(n, 0, sizeof(n));
        getnext();
        print(len);
        printf("\n");
    }
    return 0;
}