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

     

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


    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
     
    Source
     
    Recommend
    lcy
     
     
    调换a,b字符串,在原b串中匹配原a串的前缀,若现a串最后一位的匹配长度大于0,说明可以匹配到。
     
    这里从0开始存字符串,处理数据的时候总要偏移一位……
     1 /*by SilverN*/
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<cstring>
     5 #include<cstdio>
     6 #include<cmath>
     7 using namespace std;
     8 const int mxn=60000;
     9 int nxt[mxn];
    10 int f[mxn];
    11 char a[mxn],b[mxn];
    12 int la,lb;
    13 void getnext(){
    14     int i,j=-1;
    15     nxt[0]=-1;
    16     for(i=1;i<lb;i++){
    17         while(j>=0 && b[j+1]!=b[i])j=nxt[j];
    18         if(b[j+1]==b[i])j++;
    19         nxt[i]=j;
    20     }
    21     return;
    22 }
    23 int main(){
    24     while(scanf("%s%s",b,a)!=EOF){
    25         la=strlen(a);
    26         lb=strlen(b);
    27         getnext();
    28         int i,j=-1;
    29         for(i=0;i<la;i++){
    30             while(j>=0 && b[j+1]!=a[i])j=nxt[j];
    31             if(b[j+1]==a[i])j++;
    32             f[i]=j;
    33         }
    34         if(f[la-1]==-1){
    35             printf("0
    ");
    36         }
    37         else{
    38             for(i=0;i<=f[la-1];i++)printf("%c",b[i]);
    39             printf(" %d
    ",f[la-1]+1);
    40         }
    41     }
    42     return 0;
    43 }
  • 相关阅读:
    SVN版本库修改URL路径或者IP地址
    ES-PHP向ES批量添加文档报No alive nodes found in your cluster
    ansible IP
    ansible ansible_os_family == "RedHat" and ansible_lsb.major_release|int >= 6 转为数字比大小
    Centos下Yum安装PHP5.5,5.6,7.0
    centos6.8上yum安装zabbix3.2
    线性筛的理解及应用
    5分钟使用docker搭建一个WordPress
    使用 Docker-Compose 编排容器
    Bootstrap基础
  • 原文地址:https://www.cnblogs.com/SilverNebula/p/5865761.html
Copyright © 2011-2022 走看看