【hdu2594】Simpsons’ Hidden Talents——KMP
来源:互联网 发布:c语言奇数阶幻方 编辑:程序博客网 时间:2024/05/26 22:59
题目:
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5599 Accepted Submission(s): 2025
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
描述:给两个字符串s1,s2,求2的前缀是1的后缀的最大长度
题解:把两个字符串拼在一起求一遍nxt数组就行了,但要注意长度不能超过两个字符串的最小长度
代码:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1e5+10;char text[maxn], pattern[maxn];int nxt[maxn];int main(){//freopen("input.txt", "r", stdin);while (scanf("%s",text)!=EOF){scanf("%s", pattern);int len1 = min(strlen(text), strlen(pattern));strcat(text, pattern);int len = strlen(text);for (int i = 0, j = -1; i <= len; i++, j++){nxt[i] = j;while (~j && text[i] != text[j])j = nxt[j];}for (int i = 0; i < nxt[len] && i < len1; i++){printf("%c", text[i]);if (i == nxt[len] - 1 || i == len1 - 1)printf(" ");}printf("%d\n", min(nxt[len], len1)); //attentionmemset(text, 0, sizeof(text));memset(pattern, 0, sizeof(pattern));}return 0;}
0 0
- 【hdu2594】Simpsons’ Hidden Talents——KMP
- 【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
- hdu2594 Simpsons’ Hidden Talents (kmp)
- HDU2594 Simpsons’ Hidden Talents(KMP)
- HDU2594:Simpsons’ Hidden Talents
- hdu2594-Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents
- hdu2594 Simpsons’ Hidden Talents
- HDU2594 Simpsons’ Hidden Talents
- HDU2594 Simpsons’ Hidden Talents
- 自己写一个httpclient(一)
- 简谈ready与load的区别
- android 硬件知识-传感器,无线电,和媒体功能的开发
- Vmware安装debian时更换iso文件方法
- hdu 1080(LCS变形)
- 【hdu2594】Simpsons’ Hidden Talents——KMP
- flask下博客系统输入中文乱码问题(ubuntu14.04+mysql5.5.46)
- bzoj 1187 [HNOI2007]神奇游乐园
- 帧动画
- spark集群内存不足可以采用的一些措施
- Android RelativeLayout控件 比较疑惑的问题
- 史玉柱:每季度10%末尾淘汰 把巨人从兔子窝改成狼群
- STL任务库简介
- java集合-ArrayList