zoukankan      html  css  js  c++  java
  • HDU1358 KMP(最短循环节)

    Period

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


    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
     

    题意:

    求字符串s每个前缀的最短循环节。求一个最大整数k,使得s的前i个字符组成的前缀是某个字符串重复k次得到的,输出i和k。

    代码:

    //白书213页例题。
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    char P[1000006];
    int n,f[1000006];
    int main()
    {
        int cas=0;
        while(scanf("%d",&n)&&n){
            scanf("%s",P);
            f[0]=f[1]=0;
            for(int i=1;i<n;i++){
                int j=f[i];
                while(j&&P[i]!=P[j]) j=f[j];
                f[i+1]=(P[i]==P[j]?j+1:0);
            }
            printf("Test case #%d
    ",++cas);
            for(int i=2;i<=n;i++)
                if(f[i]!=0&&i%(i-f[i])==0) printf("%d %d
    ",i,i/(i-f[i]));
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    maven安装以及eclipse配置maven
    jquery 图片文件转base64 显示
    Java 解析Excel文件为JSON
    Dropwizard框架入门
    使用Spring Security和OAuth2实现RESTful服务安全认证
    SQL语句大小写是否区分的问题,批量修改整个数据库所有表所有字段大小写
    13个可实现超棒数据可视化效果的Javascript框架
    C#创建数字证书并导出为pfx,并使用pfx进行非对称加解密
    C#使用RSA证书文件加密和解密示例
    C# 中使用 RSA加解密算法
  • 原文地址:https://www.cnblogs.com/--ZHIYUAN/p/6418750.html
Copyright © 2011-2022 走看看