HDU 1867 KMP
来源:互联网 发布:2017年9月宏观数据 编辑:程序博客网 时间:2024/06/05 08:04
第一次写的时候是直接使用next数组的,思路应该是对的,但是一直是数组越界。。。。。。
所以换了种思路,直接用KMP,(可以多试几个案例。。。)
A + B for you again
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4490 Accepted Submission(s): 1155
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 <stdio.h>#include <stdlib.h>#include <limits.h>#include <ctype.h>#include <malloc.h>#include <string.h>#include <string>#include <algorithm>#include <iostream>#include <deque>#include <vector>#include <set>#include <map>using namespace std;#define MAXN 100000 + 100char a[MAXN],b[MAXN];int next1[MAXN],next2[MAXN];void Getnext(char a[],int next[]){ int i = 0; int j = -1; next[0] = -1; int len = strlen(a); while(i < len){ if(j==-1 || a[i]==a[j]){ i++; j++; next[i] = j; } else{ j = next[j]; } }}int KMP(char a[],char b[],int next[]){ int i=0,j=0; int len1 = strlen(a); int len2 = strlen(b); while(i < len1){ if(j==-1 || a[i]==b[j]){ i++; j++; } else{ j = next[j]; } } return j;}int main(){ int i; while(~scanf("%s",a)){ scanf("%s",b); memset(next1,0,sizeof(next1)); memset(next2,0,sizeof(next2)); Getnext(a,next1); Getnext(b,next2); int len1 = strlen(a); int len2 = strlen(b); int s1 = KMP(a,b,next2); int s2 = KMP(b,a,next1); //printf("%d %d\n",s1,s2); if(s1 == s2){ if(strcmp(a,b)<0){ printf("%s%s\n",a,b+s1); } else{ printf("%s%s\n",b,a+s1); } } //printf("%d %d\n",s1,s2); else if(s1 > s2){ printf("%s%s\n",a,b+s1); } else{ printf("%s%s\n",b,a+s2); } } return 0;}
0 0
- HDU 1867 KMP
- hdu 1867 KMP
- hdu 1867 (KMP)
- hdu 1867 kmp裸题
- HDU--1867(KMP)
- hdu 1867 kmp匹配
- HDU 1867 KMP
- hdu 1867 链接字符串+kmp
- hdu 1867 史上最裸KMP 第二弹
- HDU 1867 KMP 求最大尾部重叠
- hdu 1867 Cow Patterns kmp模板
- hdu 4333 kmp+扩展kmp
- HDU 1686 Oulipo (kmp)
- KMP hdu 1711
- HDU 1358 Period (KMP)
- hdu 1358 KMP运用
- hdu 1711(KMP)
- hdu 2203 (kmp)
- GestureDetector和SimpleOnGestureListener的使用教程
- Java环境变量的配置
- 星际之门(一)
- SGU 543 Cafe
- 阿里云产品助企业腾飞 —— 来自云上架构实践者们的经验分享
- HDU 1867 KMP
- HDU 1754 I Hate It(线段树,单点更新,线段查询)
- [视频]mac系统下虚拟机parallels安装ubuntu 14.04视频教程
- Threadstart()和run()方法的区别
- 人际交往
- 新鲜的有意义的事物
- NOR型FLASH与NAND型FLASH的区别
- .\test.sct(5): error: L6236E: No section matches selector - no section to be FIRST/LAST.
- 坦克大战