zoukankan      html  css  js  c++  java
  • HDU2594——Simpsons’ Hidden Talents

    Problem Description
    Homer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.
    Marge: Yeah, what is it?
    Homer: Take me for example. I want to find out if I have a talent in politics, OK?
    Marge: OK.
    Homer: So I take some politician’s name, say Clinton, and try to find the length of the longest prefix
    in Clinton’s name that is a suffix in my name. That’s how close I am to being a politician like Clinton
    Marge: Why on earth choose the longest prefix that is a suffix???
    Homer: Well, our talents are deeply hidden within ourselves, Marge.
    Marge: So how close are you?
    Homer: 0!
    Marge: I’m not surprised.
    Homer: But you know, you must have some real math talent hidden deep in you.
    Marge: How come?
    Homer: Riemann and Marjorie gives 3!!!
    Marge: Who the heck is Riemann?
    Homer: Never mind.
    Write a program that, when given strings s1 and s2, finds the longest prefix of s1 that is a suffix of s2.
     

    Input
    Input consists of two lines. The first line contains s1 and the second line contains s2. You may assume all letters are in lowercase.
     

    Output
    Output consists of a single line that contains the longest string that is a prefix of s1 and a suffix of s2, followed by the length of that prefix. If the longest such string is the empty string, then the output should be 0.
    The lengths of s1 and s2 will be at most 50000.
     

    Sample Input
    clinton homer riemann marjorie
     

    Sample Output
    0 rie 3
     
     
    分析:
    两个字符串s1和s2, 求出是s1的前缀并且是s2的后缀的最长的字符串。
     
     
    #include<iostream>
    #include<string.h>
    #include<stdio.h>
    #include<ctype.h>
    #include<algorithm>
    #include<stack>
    #include<queue>
    #include<set>
    #include<math.h>
    #include<vector>
    #include<map>
    #include<deque>
    #include<list>
    using namespace std;
    char a[50009],b[50009];
    int next[50009];
    int m,n;
    int i,j;
    void getnext()
    {
        int i=0;
        int j=-1;
        next[0]=-1;
        while(i<n)
        {
            if(j==-1||b[i]==b[j])
            {
                i++;
                j++;
                if(b[i]!=b[j])
                    next[i]=j;
                else
                    next[i]=next[j];
            }
            else
                j=next[j];
        }
    }
    int kmp()
    {
        int i=0;
        int j=0;
        while(i<m)
        {
            if(j==-1||a[i]==b[j])
            {
                i++;
                j++;
            }
            else
            {
                j=next[j];
            }
        }
        return j;
    }
    int main()
    {
        while(gets(b))
        {
            gets(a);
            m=strlen(a);
            n=strlen(b);
            getnext();
            int p=kmp();
            for(int i=0; i<p; i++)
                printf("%c",b[i]);
            if(p)
                printf(" ");
            printf("%d
    ",p);
        }
        return 0;
    }
    

  • 相关阅读:
    第5章:文本处理
    第4章:查找与替换
    第3章:正则表达式
    命令行获取苹果电脑的主要硬件配置
    Linux的tree命令
    log4j.xml的实用例子
    史上最牛js
    Some warning were found during validation
    记十多年前的一次培训经历
    Mac OS X上IntelliJ IDEA 13与Tomcat 8的Java Web开发环境搭建
  • 原文地址:https://www.cnblogs.com/pangblog/p/3271321.html
Copyright © 2011-2022 走看看