zoukankan      html  css  js  c++  java
  • KMP


    推荐视频:http://www.bilibili.com/mobile/video/av3246487.html


    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


    #include<stdio.h>
    #include<string.h>
    int lena,lenb;
    char a[1000010];
    int next[1000010];
    void get_next()
    {
    	int i=1,j=0;
    	next[0]=0;
    	while(i<lena)
    	{
    		if(j>0 && a[i]!=a[j])
    		{
    			j=next[j-1];
    		}
    		else if(j==0 && a[i]!=a[j])
    		{
    			next[i]=0;
    			i++;
    		}
    		else
    		{
    			next[i]=j+1;
    			i++;
    			j++;
    		}
    	}
    //	for(i=0;i<lena;i++)
    //		printf("%d ",next[i]);
    	int k=0;
    	for(i=1;i<lena;i++)
    	{
    		k=i+1-next[i];
    		if((i+1)%k==0 && next[i]!=0)
    			printf("%d %d
    ",i+1,(i+1)/k); 
    	}
    }
    int main() 
    {
    	int len,i,flag=0;
    	while(scanf("%d",&lena),lena!=0)
    	{
    		scanf("%s",a);
    		flag++;
    		//if(flag>1)
    		//	printf("
    Test case #%d
    ",flag);
    		//else
    			printf("Test case #%d
    ",flag);
    		
    		get_next();
    		printf("
    ");
    	}
    	return 0;
    }


  • 相关阅读:
    open-falcon之agent
    centos 7 部署 open-falcon 0.2.0
    高可用Redis服务架构分析与搭建
    python操作mongo脚本
    mongo查询日期格式数据
    离线下载pip包安装
    mongo同步到es
    mongo ttl索引
    kibana多台服务部署
    logstash过滤配置
  • 原文地址:https://www.cnblogs.com/szj-lxl/p/6684514.html
Copyright © 2011-2022 走看看