hdu2594(kmp求next)
来源:互联网 发布:北师大网络登录 编辑:程序博客网 时间:2024/05/18 21:48
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10051 Accepted Submission(s): 3478
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
#include<string>#include<string.h>#include<iostream>using namespace std;const int maxn=100000+10;char s1[maxn],s2[maxn];int nxt[maxn]; void get_nxt(char *s){int i=-1;int j=0,len=strlen(s);nxt[0]=-1;while(j<len){if(i==-1||s[i]==s[j]) nxt[++j]=++i;else i=nxt[i];}return;}int main(){while(scanf("%s%s",s1,s2)!=EOF){int len1=strlen(s1);int len2=strlen(s2);int len=len1+len2;strcat(s1,s2);get_nxt(s1);while(nxt[len]>len1||nxt[len]>len2) len=nxt[len];len=nxt[len];for(int i=0;i<len;i++)cout<<s1[i];if(len)cout<<' ';cout<<len<<endl;}}
阅读全文
0 0
- hdu2594(kmp求next)
- hdu2594 Simpsons’ Hidden Talents kmp next函数的运用
- HDU2594 Simpsons’ Hidden Talents(kmp,next的性质)
- hdu2594 kmp
- hdu2594(KMP)
- HDU2594 【KMP】
- KMP算法求next数组
- 两道水kmp-求next数组
- KMP求next数组详解
- hdu2594之KMP入门
- hdu2594 简单KMP
- hdu2594(kmp)
- KMP(2)--hdu2594
- hdu2594(KMP水题)
- hdu2594--kmp入门题
- kmp求next数组值的方法
- KMP算法之求next 的值
- KMP算法 求next数组的原理
- KVO的简单使用
- mock中的spec的一点用法
- gulp常用插件整理
- Keras深度学习框架配置
- LeetCode.38 Count and Say
- hdu2594(kmp求next)
- [Leetcode]_39 Combination Sum
- C# 通过反射如何访问静态成员
- quick-cocos2d-x API函数汇总
- 【转】写代码怎能不会这些linux命令
- JavaScript 函数表达式 闭包
- 正则表达式
- RSA算法证明-证明过程
- JAVA开发的23种设计模式之 --- 访问者模式