HDU2594 （kmp，求两字符串的前后缀相同长度最大,水题）

 

 

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

题意：

给你两个字符串，让你求一个字符串 这个字符串满足是第二个字符串的后缀，且是第一个字符串的前缀，找出满足情况的最长的字符串

思路：

1.可以将两个字符串连接起来 用next数组的意义来做，找出最后下标的最大匹配即可

2.利用kmp的意义，如果第二个字符串的前j个字符的最大匹配为k,那么即为j-1的字符串的最大匹配且第j个字符与匹配的第k个字符相等即可.

//第二种方法
#include
#include
#include
#include
#include
using namespace std;
const int maxn=5e4+7;
int net[maxn],res[maxn];
char p[maxn],str[maxn];
void get_next(char *p,int *net)
{
    int lp=strlen(p);
    int j=0,k=-1;
    net[0]=-1;
    net[++j]=++k;
    while(j