超级会员免费看
该博客介绍了UVA在线判题系统中的第1328题，题目要求找到给定字符串的所有前缀的周期（如果存在的话）。博主通过KMP算法来解决这个问题，并给出了解题思路和参考代码。
Period
来源：UVA
标签：字符串->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 AK, that is A concatenated K times, for some string A. Of course, we also want to know the period K.
输入
The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 ≤ N ≤ 10000
订阅专栏 解锁全文
扫一扫
869
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
