zoukankan      html  css  js  c++  java
  • HDU A + B for you again (KMP)

    A + B for you again

    Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
    Total Submission(s) : 30   Accepted Submission(s) : 9
    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<iostream>
    #include<cstdio>
    #include<cstring>
    
    using namespace std;
    
    const int maxn=100010;
    
    int next[maxn];
    char s1[maxn],s2[maxn];
    
    void getnext(char *t){
        int len=strlen(t);
        int i=0,j=-1;
        next[0]=-1;
        while(i<len){
            if(j==-1 || t[i]==t[j]){
                i++;j++;
                next[i]=j;
            }else
                j=next[j];
        }
    }
    
    int KMP(char *s,char *t){
        int len1=strlen(s),len2=strlen(t);
        int i=0,j=0;
        getnext(t);
        while(i<len1 && j<len2){
            if(j==-1 || s[i]==t[j]){
                i++;j++;
            }else
                j=next[j];
        }
        if(i==len1)
            return j;
        return 0;
    }
    
    int main(){
    
        //freopen("input.txt","r",stdin);
    
        while(~scanf("%s%s",s1,s2)){
            int x=KMP(s1,s2);
            int y=KMP(s2,s1);
            if(x==y){
                if(strcmp(s1,s2)<0)
                    printf("%s%s\n",s1,s2+x);
                else
                    printf("%s%s\n",s2,s1+x);
            }else if(x>y)
                printf("%s%s\n",s1,s2+x);
            else
                printf("%s%s\n",s2,s1+y);
        }
        return 0;
    }
  • 相关阅读:
    关于文件路径的生成
    re模块小结
    logging模块知识点及应用小结
    微信小程序上传图片
    小程序图表插件
    小程序实现多图上传、预览
    微信小程序实现验证码倒计时效果
    微信小程序上传图片,视频及预览
    小程序实现星级打分
    小程序获取系统日期时间
  • 原文地址:https://www.cnblogs.com/jackge/p/3031199.html
Copyright © 2011-2022 走看看