zoukankan      html  css  js  c++  java
  • HDU 2594 kmp算法变形

    Simpsons’ Hidden Talents

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 2456    Accepted Submission(s): 929


    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<cstring>
    #include<cstdio>
    using namespace std;
    
    const int maxn=50005;
    int n,m;
    int f[maxn];
    char s1[maxn],s2[maxn];
    
    void getFail()
    {
        int i,j;
        f[0]=f[1]=0;
        for(i=1;i<m;i++)
        {
            j=f[i];
            while(j && s2[i]!=s2[j]) j=f[j];
            f[i+1]=(s2[i]==s2[j]?j+1:0);
        }
    }
    
    int find()
    {
        int i,j=0;
        getFail();
        for(i=0;i<n;i++)
        {
            while(j && s1[i]!=s2[j]) j=f[j];
            if(s1[i]==s2[j]) j++;
        }return j;
    }
    int main()
    {
        int ans;
        while(~scanf("%s %s",s2,s1))
        {
            n=strlen(s1);m=strlen(s2);
            ans=find();
            if(ans)    printf("%s %d
    ",s1+(n-ans),ans);
            else printf("0
    ");
        }
        return 0;
    }
     
  • 相关阅读:
    ElasticSearch6.5.0【Java客户端之TransportClient】
    ElasticSearch6.5.0 【安装IK分词器】
    ElasticSearch6.5.0 【字段类型】
    不能说的秘密
    渔已经给你们了 剩下的鱼靠你们自己来
    Xshell使用笔记
    Potplayer使用教程
    爱真的需要勇气
    中文字体练习好看的手写字
    一些学习方法
  • 原文地址:https://www.cnblogs.com/xiong-/p/3628682.html
Copyright © 2011-2022 走看看