[poj 1961]Period[kmp]

最新推荐文章于 2019-06-03 16:23:42 发布

真·skysys

最新推荐文章于 2019-06-03 16:23:42 发布

阅读量469

点赞数

分类专栏：算法与数学文章标签： poj kmp 字符串匹配

请明确标注出处

本文链接：https://blog.csdn.net/qq_33583069/article/details/51940233

版权

算法与数学专栏收录该内容

469 篇文章 58 订阅 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了POJ 1961题目，主要探讨如何找到给定字符串的最小循环节。通过KMP算法进行字符串匹配，以求解问题的解决方案。

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

Period

Time Limit: 3000MS		Memory Limit: 30000K
Total Submissions: 16202		Accepted: 7764

Description

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as A ^K<