zoukankan      html  css  js  c++  java
  • POJ2752(KMP)

    Seek the Name, Seek the Fame

    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 17175   Accepted: 8776

    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

     1 //2016.8.17
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cstring>
     5 
     6 using namespace std;
     7 
     8 const int N = 400005;
     9 char s[N];
    10 int tot, ans[N], nex[N];
    11 
    12 void getNext(int n)
    13 {
    14     nex[0] = -1;
    15     for(int i = 0, fail = -1; i < n;)
    16     {
    17         if(fail==-1||s[i]==s[fail])
    18         {
    19             i++, fail++;
    20             nex[i] = fail;
    21         }else fail = nex[fail];
    22     }
    23 }
    24 
    25 int main()
    26 {
    27     while(scanf("%s", s)!=EOF)
    28     {
    29         int n = strlen(s);
    30         getNext(n);
    31         for(int i = 0; i < n; i++)
    32               cout<<nex[i]<<" ";
    33         cout<<endl;
    34         tot = 0;
    35         int p = nex[n-1];
    36         while(p!=-1)
    37         {
    38             if(s[p] == s[n-1])
    39               ans[tot++] = p+1;
    40             p = nex[p];
    41         }
    42         for(int i = tot-1; i >= 0; i--)
    43               printf("%d ", ans[i]);
    44         printf("%d
    ", n);
    45     }
    46 
    47     return 0;
    48 }
  • 相关阅读:
    $("*")选取所有的元素
    $("p") 选取多有的元素
    $(".test")选取所有class为test的元素
    $("#test")选取id为test的元素
    数据分析工具的深度对比:FineBI vs PowerBI
    Kafka是如何处理Netflix每天2万亿条消息的?
    新补丁更新(RU和RUR),新的版本(Release 18和19)
    Cinder 的 I/O QoS
    Web前端绘制0.5像素的几种方法
    Web前端绘制0.5像素的几种方法
  • 原文地址:https://www.cnblogs.com/Penn000/p/5780098.html
Copyright © 2011-2022 走看看