zoukankan      html  css  js  c++  java
  • Poj2752--Seek the Name, Seek the Fame(Kmp → → Next数组应用)

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

    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
    

    Source

    RE:在一个字符串中寻找子串(既是前缀、 也是后缀),从小到大输出子串长度;
     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 using namespace std;
     5 char a[400040]; int p[400040], lena, num[400040];
     6 void Getp()
     7 {
     8     int i = 0, j = -1;
     9     p[i] = j;
    10     while(i < lena)
    11     {
    12         //printf("1
    ");
    13         if(j==-1 || a[i] == a[j])
    14         {
    15             i++; j++;
    16             p[i] = j;
    17             }    
    18             
    19         else
    20          j = p[j];
    21     } 
    22 } 
    23 int main()
    24 {
    25     while(~scanf("%s", a))
    26     {
    27         lena = strlen(a);
    28         Getp();
    29         int i, k = 0;
    30         for(i = lena; i != 0;)
    31         {
    32             num[k++] = p[i];
    33             i = p[i];
    34         }
    35     /*    printf("%d
    ", p[lena]);*/
    36         for(i = k-2; i >= 0; i--)
    37             printf("%d ", num[i]); 
    38         printf("%d
    ", lena); 
    39     } 
    40     return 0;    
    41 } 
     
  • 相关阅读:
    奇妙的 CSS shapes(CSS图形)
    正确的缩写document。querySelector
    Ajax异步获取html数据中包含js方法无效的解决方法
    关于前端开发中的“收口”思想
    说说JSON和JSONP,也许你会豁然开朗
    Ajax 完整教程(转载)
    GitHub与Git指令入门
    Vue.js——60分钟组件快速入门(下篇)
    Vue.js——60分钟组件快速入门(上篇)
    自定义构造函数
  • 原文地址:https://www.cnblogs.com/soTired/p/4713215.html
Copyright © 2011-2022 走看看