Bnuoj 6719 Simpsons 'den den Talents

Source: Internet
Author: User
Simpsons 'den den talentstime limit: 1000 msmemory limit: 32768 kbthis problem will be judged on HDU. Original ID: 2594
64-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: Riann and Marjorie gives 3 !!!
MARGE: Who the heck is Riann?
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. inputinput consists of two lines. the first line contains S1 and the second line contains S2. you may assume all letters are in lowercase. outputoutput 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 shocould be 0.
The lengths of S1 and S2 would be at most 50000. sample input
clintonhomerriemannmarjorie
Sample output
0rie 3
Sourcehdu 2010-05 Programming Contest solution: obtain the maximum length of the prefix and suffix, pay attention to the length
 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 long14 #define INF 0x3f3f3f3f15 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] = ‘\0‘;33         getFail();34         for(;fail[i] > len || fail[i] > len2; i--);35         len = strlen(sa);36         if(fail[i]){37             printf("%s %d\n",sa+len-fail[i],fail[i]);38         }else puts("0");39     }40     return 0;41 }
View code

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.