HDU 2595 Simpsons’ Hidden Talents (扩展kmp)

题意：给出串s1,s2 求是否s2的一个后缀等于s1的一个前缀

分析：kmp和exkmp都行

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <queue>
#include <set>
#define FRER() freopen("in.txt","r",stdin)
#define FREW() freopen("out.txt","w",stdout)
#define go int T;cin>>T;for(int kase=0;kase<T;kase++)
#define debug cout<<"****************"<<endl
#define eps 1e-6
#define mod 1000000007
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int maxn = 1000000 + 7;
int Next[maxn],ex[maxn];
template <class T> T gcd(T a,T b){return !b?a:gcd(b,a%b);}
void get_next(char *s){
    int i=0,j,po;
    int len = (int)strlen(s);
    Next[0] = len;
    while(s[i]==s[i+1]&&i+1<len) i++;
    Next[1] = i;po = 1;
    for(i=2;i<len;i++){
        if(Next[i-po]+i<Next[po]+po) Next[i] = Next[i-po];
        else{
            j=Next[po]+po-i;
            if(j<0) j=0;
            while(i+j<len&&s[j]==s[i+j])j++;
            Next[i] = j;
            po = i;
        }
    }
}
void exkmp(char *s1,char *s2){
    int i=0,j,po;
    int len1 = (int)strlen(s1),len2 = (int)strlen(s2);
    get_next(s2);
    while(s1[i]==s2[i]&&i<len1&&i<len2)i++;
    ex[0] = i;po=0;
    for(i=1;i<len1;i++){
        if(Next[i-po]+i<ex[po]+po) ex[i] = Next[i-po];
        else{
            j=ex[po]+po-i;
            if(j<0) j=0;
            while(i+j<len1&&j<len2&&s1[i+j]==s2[j]) j++;
            ex[i] = j;
            po = i;
        }
    }
}
char s1[maxn],s2[maxn];
int main(){
    //FRER();
    //FREW();
    while(~scanf("%s%s",s1,s2)){
        memset(ex, 0, sizeof(ex));
        memset(Next, 0, sizeof(Next));
        exkmp(s2, s1);
        int len = (int)strlen(s2);
        int  pos = -1;
        for(int i=0;i<len;i++){
            if(ex[i] == len-i){
                pos = i;
                break;
            }
        }
        if(pos>=0) printf("%s %d\n",s2+pos,ex[pos]);
        else printf("0\n");
    }
    return 0;
}