Simpsons’ Hidden Talents
Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 259464-bit integer IO format: %I64d Java class name: Main
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
clinton homer riemann marjorie
Sample Output
0 rie 3
Source
解题：求前缀后缀的最长相同长度，注意长度
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib> 10 #include <string> 11 #include <set> 12 #include <stack> 13 #define LL long long 14 #define INF 0x3f3f3f3f 15 using namespace std; 16 char sa[50010<<1],sb[50010]; 17 int fail[50010<<1]; 18 void getFail(){ 19 fail[0] = fail[1] = 0; 20 for(int i = 1; sa[i]; i++){ 21 int j = fail[i]; 22 while(j && sa[i] != sa[j]) j = fail[j]; 23 fail[i+1] = sa[i] == sa[j]?j+1:0; 24 } 25 } 26 int main() { 27 int i,j; 28 while(~scanf("%s %s",sa,sb)){ 29 int len = strlen(sa),len2 = strlen(sb),i = len+len2; 30 for(i = len,j = 0; sb[j]; i++,j++) 31 sa[i] = sb[j]; 32 sa[i] = ' '; 33 getFail(); 34 for(;fail[i] > len || fail[i] > len2; i--); 35 len = strlen(sa); 36 if(fail[i]){ 37 printf("%s %d ",sa+len-fail[i],fail[i]); 38 }else puts("0"); 39 } 40 return 0; 41 }