HDU2594 Simpsons’ Hidden Talents【KMP】

Simpsons’ Hidden Talents

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14998    Accepted Submission(s): 5142

 

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.

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

Source

HDU 2010-05 Programming Contest

Recommend

lcy

问题链接：HDU2594 Simpsons’ Hidden Talents

问题描述：对于字符串S,P。求最长的字符串A，满足A是S的前缀，是P的后缀

解题思路：将S和P链接起来，然后使用KMP算法的Next数组，要注意，A的长度一定是小于等于S和P的长度。因此，在最后求出Next数组时，如果Next[len]不满足条件，就要寻找更小的公共前缀后缀

AC的C++程序：

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N=50010;
char p[2*N],s[N];
int Next[2*N];

void GetNext(char p[],int next[])
{
	next[0]=-1;
	int k=-1,j=0,plen=strlen(p);
	while(j<plen)
	{
		if(k==-1||p[k]==p[j])
		{
			k++;
			j++;
			next[j]=k;
		}
		else
		  k=next[k];
	}
}

int main()
{
	while(~scanf("%s%s",p,s))
	{
		int plen=strlen(p),slen=strlen(s);
		int len=min(plen,slen);//两个字符串长度的最小值 
		strcat(p,s);//将两个字符串连在一起 
		GetNext(p,Next);
		int k=Next[plen+slen];
		while(k>len) k=Next[k];
		if(k<=0)
		  printf("0\n");
		else
		{
			p[k]='\0';
			printf("%s %d\n",p,k);
		}
	}
	return 0;
}