zoukankan      html  css  js  c++  java
  • poj 1961 Period(KMP训练指南例题)

    Period
    Time Limit: 3000MS   Memory Limit: 30000K
    Total Submissions: 11356   Accepted: 5279

    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 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 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

    Source

    题意

    给你一个字符串。叫你依次输出输出该串长度为i的前缀(如果该前缀可以由重复子串得到)的长度。产生该前缀所需的最大重复次数。

    思路:

    见训练指南。

    详细见代码:

    #include <iostream>
    #include<stdio.h>
    #include<string.h>
    using namespace std;
    const int maxn=1000100;
    int f[maxn];
    char txt[maxn];
    void getf(char *p)
    {
        int i,j,m=strlen(p);
        f[0]=f[1]=0;
        for(i=1;i<m;i++)
        {
            j=f[i];
            while(j&&p[i]!=p[j])
                j=f[j];
            f[i+1]=p[i]==p[j]?j+1:0;
        }
    }
    int main()
    {
        int len,i,t,cas=1;
    
        while(scanf("%d",&len),len)
        {
            scanf("%s",txt);
            getf(txt);
            printf("Test case #%d
    ",cas++);
            for(i=2;i<=len;i++)
            {
                t=i-f[i];
                if(f[i]&&i%t==0)
                    printf("%d %d
    ",i,i/t);
            }
            printf("
    ");
        }
        return 0;
    }
    


  • 相关阅读:
    document.body.clientHeight 和 document.documentElement.clientHeight 的区别
    Javascript操作div及其内含对象示例
    面向对象分析设计的经验原则
    翻页控件示例代码
    C#的6种常用集合类示例
    UML基础知识
    重温OSI和TCP/IP网络分层
    设计模式总结
    活用设计模式
    GridView当数据源为空时仍显示表头
  • 原文地址:https://www.cnblogs.com/pangblog/p/3325088.html
Copyright © 2011-2022 走看看