D. Prefixes and Suffixes（KMP+dp）

最新推荐文章于 2023-03-12 20:17:55 发布

年轻过成了秃顶

最新推荐文章于 2023-03-12 20:17:55 发布

阅读量723

点赞数 4

CC 4.0 BY-SA版权

分类专栏： CF KMP 文章标签： KMP dp

本文链接：https://blog.youkuaiyun.com/qq_43506138/article/details/98726846

该博客探讨了如何使用KMP算法和动态规划（dp）解决字符串中前后缀匹配的问题。通过分析next数组的含义，展示了如何找出字符串中匹配的前后缀，并给出递推公式来计算匹配的次数。给出了具体的例子和分析，帮助理解算法的应用。

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

参考博客：https://blog.youkuaiyun.com/huanghongxun/article/details/53209004
题目链接：http://codeforces.com/problemset/problem/432/D

You have a string s = s1s2…s|s|, where |s| is the length of string s, and si its i-th character.

Let’s introduce several definitions:
A substring s[i…j] (1 ≤ i ≤ j ≤ |s|) of string s is string sisi + 1…sj.
The prefix of string s of length l (1 ≤ l ≤ |s|) is string s[1…l].
The suffix of string s of length l (1 ≤ l ≤ |s|) is string s[|s| - l + 1…|s|].

Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring.
Input

The single line contains a sequence of characters s1s2…s|s| (1 ≤ |s| ≤ 105) — string s. The string only consists of uppercase English letters.
Output

In the first line