E - Period(KMP求循环节的位置以及出现的次数)

原创 2017年10月13日 10:44:30

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.
Input
The input file consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S. The second line contains the string S. The input file ends with a line, having the number zero on it.
Output
For each test case, output “Test case #” and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.
Sample Input

3
aaa
12
aabaabaabaab
0

Sample Output

Test case #1
2 2
3 3

Test case #2
2 2
6 2
9 3
12 4
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000009;
char pattern[maxn];
int nnext[maxn];
void pre()
{
   int patternLen = strlen(pattern);
   int i = 0, j = -1;
   nnext[0] = -1;
   while(i!=patternLen)
   {
      if(j==-1||pattern[i]==pattern[j])
      nnext[++i] = ++j;
      else
      j = nnext[j];
   }
}
int main()
{
  int n;
  int T = 1;
  while(~scanf("%d", &n)&&n)
  {
    scanf("%s", pattern);
    printf("Test case #%d\n", T++);
    pre();
    for(int i=2;pattern[i-1];i++)
    {
      int t = i - nnext[i];//循环的长度
      if(i%t==0&&i/t>1)
      printf("%d %d\n", i, i/t);//循环到的位置,出现的次数
    }
    printf("\n");
  }
  return 0;
}
版权声明: 如有错误,请指出~

相关文章推荐

LA 3026 && POJ 1961 Period(KMP求前缀的最短循环节)

题意: 给定一个长度为n 的字符串s,求它的每个前缀的最短循环节? 思路: 我们想一下KMP的next 函数。 next[i]表示 由S[0],S[1],,,,S[i] 构成的字符串的最大前缀...

Period (HDU_1358) KMP+循环节

Period Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total S...

Kmp找字符串循环节——Period ( POJ 1961 )

题目链接: http://poj.org/problem?id=1961 分析: 给出一个字符串长度为N,从左变开始取2~N个字符出来构成一个新字符串,若新字符串能被一个最短的循环节构成则输出新字...
  • FeBr2
  • FeBr2
  • 2016-07-15 15:09
  • 812

POJ-1961 Period-KMP前缀串重复次数

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 14803   Accepted: 7054 ...

HDU 3746 Cyclic Nacklace 利用 KMP的next数组求循环节

Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)...
  • wr132
  • wr132
  • 2015-08-08 17:00
  • 369

Kmp(求字符串公共循环节数目)——Common Divisors ( CodeForces 182D )

题目链接: http://codeforces.com/contest/182/problem/D 分析: 题意为给出两个字符串,求其公共循环节的数目,那么首先要求出其公共最小循环节!这里需要用到...
  • FeBr2
  • FeBr2
  • 2016-07-16 16:48
  • 402

用KMP来求字符串的循环节

利用KMP算法中的next值可以求出字符串的循环节,如ababab的循环节为ab,abcd的循环节为abcd,具体做法如下:假设字符串的长度为len,next[len]为字符串的最后一个字符的下一个字...

HDU 3746 KMP求循环节

Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)...

【HDU3746】【KMP】Cyclic Nacklace 最少添加字符数使得原串出现循环节

#include #include #include #include #include #include #include #include #include #include #include #...

HDU-3746-Cyclic Nacklace【KMP求循环节】【经典题】

HDU-3746-Cyclic Nacklace
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)