hdu1867之KMP
来源:互联网 发布:双肩电脑包 知乎 编辑:程序博客网 时间:2024/04/30 10:02
A + B for you again
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3061 Accepted Submission(s): 755
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 sdfgasdf ghjk
Sample Output
asdfgasdfghjk
注意题目要求的是最短的字符串能包含所给的两个字符串,这里的包含一定是前一部分或后一部分包含,不能中间包含
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<algorithm>#include<map>#include<iomanip>#define INF 99999999using namespace std;const int MAX=100000+10;char a[MAX],b[MAX];int next[MAX];void get_next(char *a,int len){int i=-1,j=0;next[0]=-1;while(j<len){if(i == -1 || a[i] == a[j]){if(a[++i] == a[++j])next[j]=next[i];else next[j]=i;}else i=next[i];}}int KMP(char *a,char *b,int lena,int lenb){get_next(a,lena);int i=0,j=0;while(i<lena && j<lenb){if(i == -1 || a[i] == b[j])++i,++j;else i=next[i];}if(i<lena || (i == lena && j == lenb))return i;//a不能是b中间部分的字串 return 0;}int main(){while(cin>>a>>b){int lena=strlen(a),lenb=strlen(b);int la=KMP(a,b,lena,lenb);int lb=KMP(b,a,lenb,lena);if(la>lb || (la == lb && strcmp(a,b)>0)){cout<<b;for(int i=la;i<lena;++i)cout<<a[i];}else{cout<<a;for(int i=lb;i<lenb;++i)cout<<b[i];}cout<<endl;}return 0;}
- hdu1867之KMP
- hdu1867 KMP
- hdu1867(kmp)
- KMP又一小扩展 hdu1867
- HDU1867-KMP算法的应用
- 【KMP】 hdu1867 A + B for you again
- hdu1867 A + B for you again KMP
- hdu1867 A + B for you again (KMP)
- HDU1867 - A + B for you again(KMP)
- HDU1867:A + B for you again(KMP)
- hdu1867 A + B for you again(kmp)
- HDU1867:A + B for you again【kmp】
- hdu1867
- hdu1867
- hdu1867
- hdu1867
- HDU1867 A + B for you again KMP应用
- 【hdu1867】A + B for you again——KMP
- (4)设计模式方法-创建型设计模式--:简单工厂模式【【【工厂方法模式
- 怎么才能不学习、不工作。(懒人必看)
- 找工作
- java 构造函数是如何执行的
- enum singleton
- hdu1867之KMP
- [zz] main函数之前--谁动了我的main
- 以一个具体的例子,深入剖析一下Android系统的绑定机制
- NYOJ 14-会场安排问题
- cygwin的安装中途种种遭遇
- void cdev_init(struct cdev *cdev, const struct file_operations *fops)
- 小米即将完成新一轮融资 传估值近百亿美元
- ubuntu ssh
- hdu_1166 敌兵布阵(树状数组)