超级会员免费看
该博客介绍了POJ 1961题目的解决方案，这是一个关于字符串周期的编程问题。对于给定的字符串，需要找出每个前缀的最大周期K（K>1）。博客内容包括题目的描述、输入输出格式、输入样例、输出样例、解题思路和参考代码。解题策略是利用KMP算法中next数组的思想，并提示在实现时注意效率，如使用scanf和printf优化输入输出速度。
Period
来源：POJ
标签：KMP算法
参考资料：
相似题目：
题目
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 ,that is A concatenated K times, for some string A. Of course, we also want to know the period K.
输入
The input consists of several test cases. Each test case consists of two lines. The fir
订阅专栏 解锁全文
扫一扫
5万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
