zoukankan      html  css  js  c++  java
  • POJ2752 Seek the Name, Seek the Fame 【KMP】

    Seek the Name, Seek the Fame
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 11602   Accepted: 5680

    Description

    The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm: 

    Step1. Connect the father's name and the mother's name, to a new string S. 
    Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S). 

    Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S?

    (He might thank you by giving your baby a name:) 

    Input

    The input contains a number of test cases. Each test case occupies a single line that contains the string S described above. 

    Restrictions: Only lowercase letters may appear in the input. 1 <= Length of S <= 400000. 

    Output

    For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.

    Sample Input

    ababcababababcabab
    aaaaa
    

    Sample Output

    2 4 9 18
    1 2 3 4 5

    题意:给定一个串。求它的子串的长度,子串满足既是主串的前缀。又是主串的后缀,将全部满足要求的子串长度依照升序输出。

    题解:next数组的简单运用,(可是读懂题意用了好久啊。

    )求出next数组后递归输出对应的后缀长度,len要单独输出。

    #include <stdio.h>
    #define maxn 400002
    
    char str[maxn];
    int next[maxn], len;
    
    void getNext()
    {
    	int i = 0, j = -1;
    	next[0] = -1;
    	while(str[i]){
    		if(j == -1 || str[i] == str[j]){
    			++i; ++j;
    			next[i] = j; //mode 1
    		}else j = next[j];
    	}
    	len = i;
    }
    
    void getVal(int n)
    {
    	if(next[n] == 0) return;
    	getVal(next[n]);
    	printf("%d ", next[n]);
    }
    
    int main()
    {
    	//freopen("stdin.txt", "r", stdin);
    	while(scanf("%s", str) == 1){
    		getNext();
    		getVal(len);
    		printf("%d
    ", len);
    	}
    	return 0;
    }


  • 相关阅读:
    使用SpringAOP获取一次请求流经方法的调用次数和调用耗时
    疫苗之殇与理性应对之道
    【做更好的职场人】理性、弹性、开放的沟通
    使用IntelljIDEA生成接口的类继承图及装饰器模式
    订单导出应对大流量订单导出时的设计问题
    预发和线上的自动化对比工具微框架
    从实战角度看如何构建高质量的软件:一线工程师的一份质量手记
    代码问题及对策
    若干设计经验教训小记
    输入输出无依赖型函数的GroovySpock单测模板的自动生成工具(上)
  • 原文地址:https://www.cnblogs.com/mfmdaoyou/p/6816561.html
Copyright © 2011-2022 走看看