A + B for you again
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3489 Accepted Submission(s): 889
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
2008杭电集训队选拔赛——热身赛
解题报告
题意是给两字符串相加,相同部分可以消掉一次,当最短长度相同时,以字母顺序小的输出。
#include<stdio.h>
#include<string.h>
int next[100010];
char str1[100010],str2[100010];
void getnext(char *str)
{
int i=0,j=-1;
int l=strlen(str);
next[0]=-1;
while(i<l)
{
if(j==-1||str[i]==str[j])
{
i++;j++;
next[i]=j;
}
else j=next[j];
}
}
int kmp(char *T,char *B)
{
int i=0,j=0;
getnext(B);
int n=strlen(T),m=strlen(B);
while(i<n&&j<m)
{
if(j==-1||T[i]==B[j])
{
i++;j++;
}
else j=next[j];
}
if(i==n)
return j;
else return 0;
}
int main()
{
int i,j;
while(scanf("%s%s",str1,str2)!=EOF)
{
int x,y;
x=kmp(str1,str2);
y=kmp(str2,str1);
if(x==y)
{
if(strcmp(str1,str2)>0)
{
printf("%s",str2);
printf("%s\n",str1+x);
}
else
{
printf("%s",str1);
printf("%s\n",str2+x);
}
}
else if(x>y)
{
printf("%s",str1);
printf("%s\n",str2+x);
}
else
{
printf("%s",str2);
printf("%s\n",str1+y);
}
}
}