HDU 1867 A + B for you again

时间：2017-08-11 10:54:57 阅读：127 评论：0 收藏：0 [点我收藏+]

标签：char hdu ext 输入 select cas 解题思路 printf count

题目：

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
题意描述：
输入两个串
输出首先保证输出结果最短的一个，其次输出两个串的字典序
解题思路：
这题的坑还是挺多的，比如需要进行两次匹配，从而求得两串不同顺序的最大的相似度，才能保证输出最短，还有是按照两个串的字典序，不是单个字母。
具体思路：使用两次KMP返回两个相似度赋值给a和b，当a==b时输出
字典序，否则根据情况输出最短的匹配结果即可。
代码实现：

 1 #include<stdio.h>
 2 #include<string.h>
 3 char s[500100],t[500100];
 4 int l1,l2;
 5 int kmp(char s[],char t[],int l1,int l2);
 6 void get_next(char t[],int next[],int l2);
 7 int next[500100];
 8 int main()
 9 {
10     int a,b,i;
11     while(scanf("%s%s",s,t) != EOF)
12     {
13         l1=strlen(s);
14         l2=strlen(t);
15         a=kmp(s,t,l1,l2);//返回两串的相似度 
16         b=kmp(t,s,l2,l1);
17         //printf("a=%d b=%d\n",a,b);
18         if(a==b)
19         {
20             if(strcmp(s,t)>0)//大于返回1，写出==1 
21             {
22                 printf("%s",t);
23                 printf("%s",s+a);
24             }
25             else
26             {
27                 printf("%s",s);
28                 printf("%s",t+b);
29             }
30         }
31         else
32         {
33             if(a>b)//输出相似度最高的那一组 
34             {
35                 printf("%s",s);
36                 printf("%s",t+a);
37             }
38             else
39             {
40                 printf("%s",t);
41                 printf("%s",s+b);    
42             }
43         }
44         printf("\n");
45     }
46     return 0;
47 }
48 int kmp(char s[],char t[],int l1,int l2)
49 {
50     int i,j;
51     get_next(t,next,l2);
52     i=0;j=0;
53     while(i<l1)
54     {
55         if(j==-1 || s[i]==t[j])
56         {
57             i++;
58             j++;
59         }
60         else
61             j=next[j];
62     }
63     //printf("j==%d\n",j);
64     return j;
65 }
66 void get_next(char t[],int next[],int l2)
67 {
68     int i,j;
69     i=1;j=0;
70     next[0]=-1;
71     while(i < l2)
72     {
73         if(j==-1 || t[i]==t[j])
74         {
75             i++;
76             j++;
77             next[i]=j;
78         }
79         else
80             j=next[j];
81     }
82     /*for(i=0;i<=l2;i++)
83         printf("%d ",next[i]);
84     printf("\n");*/
85 }