zoukankan      html  css  js  c++  java
  • HDOJ 1358

    Period

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 2258    Accepted Submission(s): 1117


    Problem 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 AK , 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
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 
     5 using namespace std;
     6 
     7 const int maxn=1001000;
     8 
     9 char str[maxn];
    10 int N,fail[maxn];
    11 
    12 void getfail()
    13 {
    14     int n=strlen(str);
    15     fail[0]=fail[1]=0;
    16     for(int i=1;i<n;i++)
    17     {
    18         int j=fail[i];
    19         while(j&&str[i]!=str[j]) j=fail[j];
    20         fail[i+1]=(str[i]==str[j])?(j+1):0;
    21     }
    22 }
    23 
    24 int main()
    25 {
    26     int cas=1;
    27     while(scanf("%d",&N)!=EOF&&N)
    28     {
    29         scanf("%s",str);
    30         printf("Test case #%d
    ",cas++);
    31         getfail();
    32         for(int i=2;i<=N;i++)
    33         {
    34             if(fail[i]&&(i%(i-fail[i])==0))
    35             {
    36                 printf("%d %d
    ",i,i/(i-fail[i]));
    37             }
    38         }
    39         putchar(10);
    40     }
    41     return 0;
    42 }
  • 相关阅读:
    Path Sum
    Binary Tree Level Order Traversal II
    Jump Game
    leedcode 刷题-V2
    (2016 年) githup 博客地址 : https://github.com/JMWY/MyBlog
    算法分类总结
    剑指 Offer 题目汇总索引
    LeedCde 题解目录
    趣味算法总目录
    常用
  • 原文地址:https://www.cnblogs.com/CKboss/p/3422091.html
Copyright © 2011-2022 走看看