zoukankan      html  css  js  c++  java
  • POJ 2752 Seek the Name, Seek the Fame

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

    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

    普通的KMP

    答案是从小到大输出,所以需要用栈存一下

     1 /*by SilverN*/
     2 #include<iostream>
     3 #include<algorithm>
     4 #include<cstring>
     5 #include<cstdio>
     6 #include<cmath>
     7 using namespace std;
     8 const int mxn=450000;
     9 char s[mxn];
    10 int next[mxn];
    11 int st[mxn];
    12 int main(){
    13     int i,j;
    14     while(scanf("%s",s+1)!=EOF){
    15         memset(st,0,sizeof st);
    16         int len=strlen(s+1);
    17         j=0;
    18         for(i=2;i<=len;i++){
    19             while(j && s[j+1]!=s[i])j=next[j];
    20             if(s[j+1]==s[i])j++;
    21             next[i]=j;
    22         }
    23         int top=0;
    24         for(i=len;i;i=next[i]){
    25             st[++top]=i;
    26         }
    27         while(top){
    28             printf("%d ",st[top--]);
    29         }
    30         printf("
    ");
    31     }
    32     return 0;
    33 }
  • 相关阅读:
    常见浏览器的兼容问题以及解决方案 (仅供参考)
    了解浏览器如何工作—渲染引擎1
    维基百科公式不能正常显示
    IDL读取fits文件
    卷积,系统
    硬盘被占用无法拔出问题解决
    Faster RCNN 改进论文及资料
    Pycharm 使用问题一览
    java eclipse 使用随笔
    Images
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5677438.html
Copyright © 2011-2022 走看看