A + B for you again
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4214 Accepted Submission(s): 1077
Problem Description
Generally speaking, there are a lot of problems about strings processing. Now you encounter another such problem. If you get two strings, such as “asdf” and “sdfg”, the result of the addition between them is “asdfg”, for “sdf” is the tail substring of “asdf” and the head substring of the “sdfg” . However, the result comes as “asdfghjk”, when you have to add “asdf” and “ghjk” and guarantee the shortest string first, then the minimum lexicographic second, the same rules for other additions.
Input
For each case, there are two strings (the chars selected just form ‘a’ to ‘z’) for you, and each length of theirs won’t exceed 10^5 and won’t be empty.
Output
Print the ultimate string by the book.
Sample Input
asdf sdfg asdf ghjk
Sample Output
asdfg asdfghjk
Author
Wang Ye
Source
Recommend
【题意】kmp
【思路】kmp匹配~~
【代码】
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int const MAXN=100000+10;
char T[MAXN],S[MAXN];
int P[MAXN];
void KMP_solveS(const char *S,int *P)
{
P[0]=-1;
int j=-1;
int lenS=strlen(S);
for(int i=1;i<lenS;i++)
{
while(j>=0&&S[j+1]!=S[i])
j=P[j];
if(S[j+1]==S[i])
j=j+1;
P[i]=j;
}
}
int KMP(const char *T,const char *S)
{
int lenT=strlen(T);
int lenS=strlen(S);
KMP_solveS(S,P);
int j=-1;
for(int i=0;i<lenT;i++)
{
while(j>=0&&S[j+1]!=T[i])
j=P[j];
if(S[j+1]==T[i])
j=j+1;
if(j==lenS-1)
{
if(i==lenT-1)
break;
j=P[j];
}
}
return j;
}
int main()
{
while(scanf("%s%s",T,S)!=EOF)
{
int l1=KMP(T,S);
int l2=KMP(S,T);
int len1=strlen(T);
int len2=strlen(S);
if(l2<l1||((l1==l2)&&strcmp(T,S)<=0))
printf("%s%s\n",T,S+l1+1);
else
printf("%s%s\n",S,T+l2+1);
}
return 0;
}