HDU2594 Simpsons’ Hidden Talents
来源:互联网 发布:手机淘宝怎么解除绑定 编辑:程序博客网 时间:2024/06/09 19:23
题目链接:HDU2594
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5775 Accepted Submission(s): 2085
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
题目分析:拼在一起,求next
//// main.cpp// HDU2594//// Created by teddywang on 16/5/4.// Copyright © 2016年 teddywang. All rights reserved.//#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s[100015],t[100015];int len1,len2,len,nexts[100015];void getnext(){ int i=0,j=-1; nexts[0]=-1; while(i<len) { if(j==-1||s[i]==s[j]) { if(s[++i]==s[++j]) nexts[i]=nexts[j]; else nexts[i]=j; } else j=nexts[j]; }}int main(){ while(scanf("%s",s)!=EOF) { scanf("%s",t); len1=strlen(s);len2=strlen(t); len=len1+len2; for(int i=0;i<len2;i++) s[len1+i]=t[i]; getnext(); int ans=nexts[len]; ans=min(ans,min(len1,len2)); if(ans<=0) cout<<0<<endl; else { for(int i=0;i<ans;i++) printf("%c",s[i]); cout<<" "<<ans<<endl; } memset(s,0,sizeof(s)); memset(t,0,sizeof(t)); }}
0 0
- HDU2594:Simpsons’ Hidden Talents
- hdu2594-Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents
- HDU2594 Simpsons’ Hidden Talents
- HDU2594 Simpsons’ Hidden Talents
- HDU2594-Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents
- HDU2594 Simpsons’ Hidden Talents
- 【KMP】 hdu2594 Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents kmp
- HDU2594 Simpsons’ Hidden Talents 【KMP】
- hdu2594 Simpsons’ Hidden Talents(KMP)
- HDU2594 Simpsons’ Hidden Talents【KMP】
- HDU2594 Simpsons’ Hidden Talents KMP
- HDU2594 Simpsons’ Hidden Talents KMP
- Simpsons' Hidden Talents hdu2594 kmp
- HDU2594——Simpsons’ Hidden Talents
- WHOIS查询检索,域名信息查询工具软件
- PHP中间件--ICE
- 中缀表达式,后缀表达式以及它们的转换
- jvm运行时数据区
- 面向对象三要素,五原则,六视点
- HDU2594 Simpsons’ Hidden Talents
- RelativeLayout常用属性介绍
- 文件上传中的错误处理
- Java JDBC中的Statement和PreparedStatement
- 分解质因数(C++版)
- EL表达式及其定义和使用
- Codeforces 665E Beautiful Subarrays (Trie树)
- 第九课等于之关键调用——C#计算器编程教学
- 主成分分析之数学推导