POJ 2752 (字符串中找即是前缀又是后缀的子串)

最新推荐文章于 2020-08-28 09:44:34 发布

向前走别回头

最新推荐文章于 2020-08-28 09:44:34 发布

阅读量1.2k

点赞数

分类专栏： KMP ACM算法日常文章标签： poj2752 kmp

本文链接：https://blog.csdn.net/weixin_39778570/article/details/81952309

版权

这是一道来自POJ 2752的编程题目，要求找到一个字符串中既是前缀也是后缀的子串，并按长度升序输出。给定字符串长度不超过400000，只包含小写字母。AC代码使用了next数组来求解，注意next数组不包括自身。

摘要由CSDN通过智能技术生成

Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 24200 Accepted: 12618
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 b