Simpsons’ Hidden Talents HDU - 2594 (KMP)
2018-02-02 00:59
405 查看
Simpsons’ Hidden Talents
HDU - 2594Homer: 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.
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. Sample Input
clinton homer riemann marjorie
Sample Output
0 rie 3
直接以s1为模板串,以s2为目标串进行kmp匹配,直到结束,就是s2的后缀和s1的前缀的共同最长长度
code:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 50010;
int Next[MAXN];
char s1[MAXN],s2[MAXN];
void getNext(){
int i = -1,j = 0;
int len = strlen(s1);
memset(Next,0,sizeof(Next));
Next[0] = -1;
while(j < len){
if(i == -1 || s1[i] == s1[j]){
i++,j++;
Next[j] = i;
}
else
i = Next[i];
}
}
int kmp(){
int i = 0,j = 0;
int lens1 = strlen(s1);
int lens2 = strlen(s2);
getNext();
while(j < lens2){
if(i == -1 || s1[i] == s2[j])
i++,j++;
else
i = Next[i];
}
return i;
}
int main(){
while(~scanf("%s%s",s1,s2)){
int n = kmp();
int i;
if(n==0) printf("0\n");
else{
for(i = 0; i < n; i++)
printf("%c",s1[i]);
printf(" %d\n",n);
}
}
return 0;
}
相关文章推荐
- 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的next数组应用
- HDU 2594 Simpsons’ Hidden Talents——kmp
- HDU 2594 Simpsons’ Hidden Talents kmp next数组问题
- Simpsons’ Hidden Talents HDU - 2594 kmp小变形
- HDU 2594 Simpsons’ Hidden Talents KMP
- HDU 2594 Simpsons’ Hidden Talents KMP
- HDU 2594 Simpsons’ Hidden Talents kmp || extkmp
- 【kmp算法next数组应用】Simpsons’ Hidden Talents HDU - 2594
- hdu 2594 Simpsons’ Hidden Talents
- Simpsons’ Hidden Talents HDU - 2594
- 扩展KMP ( Next数组 )——Simpson's Hidden Talents ( HDU 2594 )
- Number Sequence HDU - 1711 + 剪花布条 HDU - 2087 + Simpsons’ Hidden Talents HDU - 2594
- hdu 2594 Simpsons’ Hidden Talents 【KMP】
- hdu2594 Simpsons’ Hidden Talents kmp next函数的运用
- HDU 2594(Simpsons’ Hidden Talents)字符串匹配-KMP
- hdu 2594 Simpsons’ Hidden Talents(KMP入门)