zoukankan      html  css  js  c++  java
  • (KMP)Seek the Name, Seek the Fame -- poj --2752

    http://poj.org/problem?id=2752

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

    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
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<stack>
    using namespace std;
    
    #define N 1000007
    #define max(a,b) (a>b?a:b)
    
    int Next[N];
    char S[N];
    
    void FindNext(int Slen)
    {
        int i=0, j=-1;
        Next[0] = -1;
    
        while(i<Slen)
        {
            if(j==-1 || S[i]==S[j])
                Next[++i] = ++j;
            else
                j = Next[j];
        }
    }
    
    int main()
    {
    
        while(scanf("%s", S)!=EOF)
        {
            int Slen, n;
    
            Slen = strlen(S);
            n = Slen;
            FindNext(Slen);
    
            stack<int>Q;
    
            while(n)
            {
              Q.push(Next[n]);
              n = Next[n];
            }
    
            Q.pop();
            while(Q.size())
            {
                printf("%d ", Q.top());
                Q.pop();
            }
    
            printf("%d
    ", Slen);
        }
        return 0;
    }
    View Code
    勿忘初心
  • 相关阅读:
    hdu 1863
    数据结构与算法分析–Minimum Spanning Tree(最小生成树)
    hdu 1856 More is better
    hdu 1272 小希的迷宫
    数据结构与算法分析 – Disjoint Set(并查集)
    数字逻辑电路课程设计报告
    高校成绩管理数据库系统的设计与实现
    PL/0编译器(java version) – SymbolTable.java
    [jquery]添加行内容后根据下拉菜单选择内容对比之前已有选项,若有重置再提示
    bootstrap-datetimepicker 日期控件的开始日期
  • 原文地址:https://www.cnblogs.com/YY56/p/4835492.html
Copyright © 2011-2022 走看看