zoukankan      html  css  js  c++  java
  • POJ-1961 Period

    Period
    Time Limit: 3000MS   Memory Limit: 30000K
    Total Submissions: 22012   Accepted: 10679

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

    思路:和poj-2406思路相同。
    #include <iostream>
    #include<string.h>
    using namespace std;
    const int maxn = 1e6+10;
    char a[maxn];
    int ne[maxn];
    int main()
    {
        int n;
        int num=0;
        while(scanf("%d",&n)&&n!=0)
        {
            memset(ne,0,sizeof(ne));
            scanf("%s",a+1);
            for(int i=2,j=0;i<=n;i++)
            {
                while(j&&a[i]!=a[j+1]) j=ne[j];
                if(a[i]==a[j+1]) j++;
                ne[i]=j;
            }
            printf("Test case #%d
    ",++num);
            for(int i=2;i<=n;i++)
            {
                if(i%(i-ne[i])==0&&ne[i]>0)       //ne[i]>0判断没有循环节的情况
                {
                    printf("%d %d
    ",i,i/(i-ne[i]));
                }
            }
            printf("
    ");
        }
        return 0;
    }
  • 相关阅读:
    一次http请求的过程
    log4j每天生成一个文件配置
    解决eclipse中maven多模块项目显示不全的问题
    docker上启动nginx,并配置修改nginx的配置文件
    springboot项目打成jar包后台运行在linux上
    《写给大家看的设计书》粗读整理
    一些需要改进的点
    b端产品的疑问
    产品经理小白初起步
    用visualvm观察远程服务器java项目的两种办法
  • 原文地址:https://www.cnblogs.com/wjc2021/p/11300201.html
Copyright © 2011-2022 走看看