zoukankan      html  css  js  c++  java
  • HDU2594 Simpsons’ Hidden Talents (kmp找寻两串s1,s2中相同的部分)

    Simpsons’ Hidden Talents

    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中相同的部分

    思路:kmp

    注意:next[]不可用,next会出现编译错误,,可用nexts[]

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <algorithm>
    using namespace std;
    char s1[50005],s2[50005];
    int nexts[50005];
    int ex[50005];
    int len,len1,len2;
    void getNext(char *p)
    {
        int j=0;
        int k=-1;
        len=strlen(p);
        nexts[0]=-1;
        while(j<len)
        {
            if(k==-1||p[j]==p[k])
            {
                j++;
                k++;
                nexts[j]=k;
            }
            else
               k=nexts[k];
        }
    }
    void get_ex(char *p,char *q)
    {
        int i=0;
        int k=0;
        getNext(p);
        len1=strlen(p);
        len2=strlen(q);
        ex[0]=0;
        while(i<len2)
        {
            if(k==-1||p[k]==q[i])
            {
                i++;
                k++;
                ex[i]=k;
            }
            else
                k=nexts[k];
        }
        //printf()
    }
    int main()
    {
        while(~scanf("%s%s",&s1,&s2))
        {
            get_ex(s1,s2);
            int n=strlen(s2);
            if(ex[n]==0)
            printf("0
    ");
            else
            {
                for(int i=0;i<ex[n];i++)
                printf("%c",s1[i]);
                printf(" %d
    ",ex[n]);
            }
        }
        return 0;
    }
  • 相关阅读:
    好利獲得(意大利电信集团)
    NFS CIFS SAMBA 的联系和区别
    Common Internet File System
    服务信息块协议 SMB(Server Message Block protocol)
    TF卡和SD卡的区别
    Robots协议(爬虫协议、机器人协议)
    语义后承(semantic consequence),句法后承(syntactic consequence),实质蕴含(material implication / material conditional)
    Word 页眉插入自动标题(页眉显示章节标题)
    Intel® Core™ i5-5300U Processor
    linux的chmod,chown命令详解
  • 原文地址:https://www.cnblogs.com/dshn/p/4750744.html
Copyright © 2011-2022 走看看