HDU 2594 Simpsons’ Hidden Talents kmp next数组问题
来源:互联网 发布:nginx 只允许本地访问 编辑:程序博客网 时间:2024/05/21 17:45
Simpsons’ Hidden Talents
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2704 Accepted Submission(s): 1024
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串的后缀
理解了kmp的next数组后就很简单了。。。
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;const int maxn=55555;char s1[maxn*2],s2[maxn*2],s[maxn*2];int next[maxn*2];void get_next(char* s,int* next){ int i,j; int len=strlen(s); next[0]=-1; i=0,j=-1; while(i<len) { if(j==-1||s[i]==s[j]) { i++; j++; next[i]=j; } else j=next[j]; }}int main(){ while(scanf("%s%s",s1,s2)!=EOF) { int len1=strlen(s1),len2=strlen(s2); memset(s,0,sizeof(s)); strcat(s,s1); strcat(s,s2); int len=strlen(s); get_next(s,next); int ans=next[len]; if(!ans) { cout<<0<<endl; continue; } if(ans>len1 || ans>len2) { if(len1<len2) printf("%s %d\n",s1,len1); else printf("%s %d\n",s2,len2); } else { for(int i=0;i<ans;i++) printf("%c",s1[i]); cout<<" "<<ans<<endl; } } return 0;}
0 0
- HDU 2594 Simpsons’ Hidden Talents kmp next数组问题
- [KMP-next数组特性]HDU 2594 Simpsons’ Hidden Talents
- HDU 2594 Simpsons’ Hidden Talents KMP的next数组应用
- 【kmp算法next数组应用】Simpsons’ Hidden Talents HDU
- hdu 2594 Simpsons’ Hidden Talents KMP中next【】数组的应用
- HDU 2594 Simpsons’ Hidden Talents(KMP,next数组的应用)
- HDU 2594 Simpsons’ Hidden Talents(KMP的Next数组应用)
- 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
- HDU 2594 Simpsons’ Hidden Talents (KMP)
- EMC遇上微软:四大产品解决方案汇总
- [Java 12 IO] 字符编码初步
- 在windows下编译openOffice
- C++ 中dynamic_cast<>的使用方法
- 计算机网络笔记---网络层---RARP的替代者DHCP
- HDU 2594 Simpsons’ Hidden Talents kmp next数组问题
- TCP/IP、Http、Socket的区别
- linux -- 用脚本设置环境变量
- Android学习第一课:搭建环境
- [Java 12 IO] Serializable 初步 ObjectOutputStream ObjectInputStream 将序列化的对象打出来
- Fragment中onActivityResult不响应
- 顺时针初始化矩阵,S型初始化矩阵-C语言
- 自定义 UITableViewCell 的 accessory 样式
- 晒订单赢图灵图书,《第一行代码——Android》福利活动劲爆来袭!