hdu 2594 Simpsons’ Hidden Talents
来源:互联网 发布:javascript的面相对象 编辑:程序博客网 时间:2024/06/18 03:36
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5556 Accepted Submission(s): 2006
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: 1711 1686 2595 2596 2597
#include<iostream>#include<cstdio>#include<cstring>#define N 100000using namespace std;int n,m,t[N];char s1[N],s[N];void calc(){ t[0]=-1; int j; for (int i=0;i<n;i++) { j=t[i]; while (j!=-1&&s1[i]!=s1[j]) j=t[j]; t[i+1]=++j; }}int solve(){ int i=0; int j=0; while (i<m) { if (j==-1||s1[j]==s[i]) i++,j++; else j=t[j]; if(i==m) return j; } return 0;}int main(){ while (~scanf("%s",s1)) { scanf("%s",s); n=strlen(s1); m=strlen(s); calc(); int k=solve(); if (k) { for (int i=0;i<k;i++) printf("%c",s1[i]); printf(" "); } printf("%d\n",k); }}
0 0
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU - 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents
- hdu 2594 Simpsons’ Hidden Talents
- win10 uwp App-to-app communication 应用通信
- “代理服务器拒绝连接“问题
- Java网络编程之JavaMail发送邮件和接受邮件
- 存储过程(一)后台使用jdbc集成
- OA项目实战学习(1)
- hdu 2594 Simpsons’ Hidden Talents
- 20-30岁,你拿这十年做什么(读书摘录)
- UDP封装基础学习记录
- 存储过程(二) 逻辑判断
- android 用gson解析遍历json数据
- 保存图片
- HTTP深入浅出 http请求
- POJ2479&&POJ2593 Maximum sum&&Max Sequence(最大连续和)
- ubuntu使用apt get install 安装nginx和php-fpm