HDU 2594 Simpsons’ Hidden Talents(KMP+A串的前n个字符与B串的后n个字符相同,使n尽可能大)
来源:互联网 发布:mac的airdrop在哪里 编辑:程序博客网 时间:2024/05/18 16:38
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8831 Accepted Submission(s): 3079
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.
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.
The lengths of s1 and s2 will be at most 50000.
Sample Input
clintonhomerriemannmarjorie
Sample Output
0rie 3
Source
HDU 2010-05 Programming Contest
Recommend
lcy | We have carefully selected several similar problems for you: 1686 2595 2596 2597 2598
#include <iostream> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <algorithm> using namespace std; typedef long long ll; const int inf=0x3f3f3f3f; const int maxn=100010; const int mod=10007; char str1[maxn],str2[maxn]; int Next[maxn]; void makenext(int m){ int i=0,j=-1; Next[i]=-1; while(i<m){ if(j==-1||str1[i]==str1[j]) Next[++i]=++j; else j=Next[j]; } } //int KMP(int n,int m){ // int i=0,j=0,ans=0; // while(i<n){ // if(j==-1||str2[i]==str1[j]) i++,j++; // else j=Next[j]; // if(j==m){ // ans++;j=Next[j-1];i--; // } // } // return ans; //} int main(){ while(scanf("%s%s",str1,str2)!=-1){ int len1=strlen(str1); int len2=strlen(str2); strcat(str1,str2); int len=strlen(str1); makenext(len); int ans=Next[len]; if(ans==0) printf("0\n"); else if(ans>=len1||ans>=len2){ if(len1<len2){ for(int i=0;i<len1;i++) printf("%c",str1[i]); printf(" %d\n",len1); }else{ printf("%s %d\n",str2,len2); } }else{ for(int i=0;i<ans;i++) printf("%c",str1[i]); printf(" %d\n",ans); } } return 0; }
0 0
- HDU 2594 Simpsons’ Hidden Talents(KMP+A串的前n个字符与B串的后n个字符相同,使n尽可能大)
- HDU 2594 Simpsons’ Hidden Talents KMP的next数组应用
- 返回前n个字符
- [HDU 2594]Simpsons’ Hidden Talents[kmp求公共前后缀]
- 【KMP】hdu 1867 A + B for you again(外:hdu 2594 Simpsons’ Hidden Talents)
- [字符串]strncasecmp() -- 比较字符串的前n个字符
- 实现字符串(char*)的前N个字符放到后面
- 截取字符串,只截取前N个字节的字符
- HDU 2594 Simpsons’ Hidden Talents(KMP)
- KMP hdu-2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents KMP
- HDU 2594Simpsons’ Hidden Talents(KMP运用)
- HDU 2594 Simpsons’ Hidden Talents KMP
- hdu 2594 Simpsons’ Hidden Talents(KMP)
- hdu 2594 Simpsons’ Hidden Talents(KMP)
- HDU 2594 Simpsons’ Hidden Talents(KMP)
- hdu 2594 Simpsons’ Hidden Talents(KMP)
- HDU 2594 Simpsons’ Hidden Talents KMP
- 每日刷题:lightoj-1004
- Android studio 通过以servlet搭建的服务器访问 PC端 mysql数据库(一)
- 安卓Studio上使用Git进行代码控制一
- Angular2环境配置
- 语音识别的解码器所生成的lattice,如何以可视化的方式展现出来
- HDU 2594 Simpsons’ Hidden Talents(KMP+A串的前n个字符与B串的后n个字符相同,使n尽可能大)
- 电路仿真-----Multisim 12.0 搭建并仿真51单片机最小系统
- MySQL基础知识四
- Window串口相关API
- MTK lk源码解析3( lk 阶段thread.c解析)
- 高可用实践之二 双机热备负载均衡方案
- 二维数组求周长的问题
- sonar:gradle集成sonar插件配置方式
- GDOI模拟4.15~4.17总结