HDU1867:A + B for you again
来源:互联网 发布:北京seo服务价格 编辑:程序博客网 时间:2024/06/13 20:38
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
//kmp,菏泽题只要注意下题目就好了
#include <stdio.h>#include <string.h>int next[100005];void getnext(char str[]){ int i = 1,j = 0; int len = strlen(str); next [0] = -1; while(i < len) { if(j == -1 || str[i] == str[j]) { i++; j++; next[i] = j; } else j = next[j]; }}int kmp(char str1[],char str2[]){ int i= 0,j = 0; int len1 = strlen(str1),len2 = strlen(str2); getnext(str2); while(i<len1 && j<len2) { if(j == -1 || str1[i] == str2[j]) { i++; j++; } else j = next[j]; } if(i == len1) return j; return 0;}int main(){ int x,y; char str1[100005],str2[100005]; while(scanf("%s%s",str1,str2)!=EOF) { 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); } } return 0;}
- 【KMP】 hdu1867 A + B for you again
- HDU1867:A + B for you again
- hdu1867 A + B for you again KMP
- hdu1867 A + B for you again
- HDU1867 A + B for you again
- hdu1867 A + B for you again (KMP)
- HDU1867 A + B for you again
- HDU1867 - A + B for you again(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
- HDU1867 A + B for you again KMP应用
- 【hdu1867】A + B for you again——KMP
- A + B for you again hdu1867(KMP的应用)
- 【KMP】hdu1867(A + B for you again) 杭电java a题真坑
- A + B for you again
- NYOJ-139:我排第几个
- android中context及全局变量小析 .
- 需求管理工作指南
- Fix for Outlook 2010 hangs on synchronize folders when send receive
- linux读取配置文件
- HDU1867:A + B for you again
- 深入JVM系列(一)之内存模型与内存分配
- 解决ping unkown host 问题
- C语言中跨文件的全局变量
- BlackBerry 10 , BlackBerry OS 7.1 手机通过蓝牙串口读取Arduino 蓝牙传过来的温度 湿度信息
- 聊聊并发(三)——JAVA线程池的分析和使用
- 链接器工具错误 LNK2026 XXX模块对于 SAFESEH 映像是不安全的
- 共享文件夹无法打开——服务器存储空间不足,无法处理此命令
- 检测到"_ITERATOR_DEBUG_LEVEL"的不匹配项