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
题意:给定两个字符串P和S,让你找一个最长的字符串T满足T是P的前缀,也是S的后缀。
这道题猛一看可能没什么思路。不过如果你对KMP的过程非常清楚的话,你会发现KMP用P去匹配S的过程中,如果S[i]匹配上了P[j]那就说明P[1..j]是S[1..i]的最长后缀,同时P[1..j]显然是P的前缀。所以我们只要找到第一个匹配上S[n]的P[j]的即可,这时j就是答案。
AC code
#include<cstring>
#include<cstdio>
#include<iostream>
using namespace std;
int nxt[1000001];
int ans,n,m;
char p[1000001], s[1000001];
int main(){
while(scanf("%s%s", p+1,s+1) != EOF){
n = strlen(s+1);
m = strlen(p+1);
ans = 0;
nxt[0] = -1;
int j = -1;
for(int i=1; i<=m; i++){
while(j>=0 && p[j+1]!=p[i]) j = nxt[j];
nxt[i] = ++j;
}
j = 0;
for(int i=1; i<=n; i++){
char c = s[(i-1)%n +1];
while(j>=0 && p[j+1]!=c) j = nxt[j];
if(++j == m){
if(i==n) break; // 整串匹配到s串的后缀
j = nxt[j]; // p串匹配完跳回匹配好的继续匹配,直到s串匹配完 i==n
}
}
if(j==0) printf("%d\n", 0);
else{
p[j+1] = 0; // 终止字符
printf("%s %d\n", p+1,j);
}
}
return 0;
}