FZU-2275 Game 【KMP

题解：

求B是否是A的字串或者反子串

 

 一直有一种情况没有考虑到：

如果字符串B一开始为0，那么应该是Alice胜

 

 代码：

#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#define maxn 100005
using namespace std;
char a[maxn],b[maxn],fb[maxn];
int nexttb[maxn],nexttfb[maxn];
int la,lb,lfb;
void getnext(int m,char b[maxn],int nextt[maxn]){
    int i=0,j=-1;
    nextt[0]=-1;
    while(i<m){
        if(j==-1||b[i]==b[j]){
            i++;
            j++;
            nextt[i]=j;
        }
        else
            j=nextt[j];
    }
}

int KMP(int n,int m,char b[maxn],int nextt[maxn]){
    int i=0,j=0,ans=0;
    while(i<n){
        if(j==-1||a[i]==b[j]){
            i++;
            j++;
        }
        else j=nextt[j];
    if(j==m)
        return 1;
    }
    return -1;
}



int main(){
    std::ios::sync_with_stdio(false);
    int T;
    cin>>T;
    while(T--){
        cin>>a;
        cin>>b;
        la=strlen(a);
        lb=strlen(b);
        int k=0;
        for(int i=lb-1;i>=0;i--){
                fb[k++]=b[i];
        }
        fb[k]='\0';
        lfb=strlen(fb);
        getnext(lb,b,nexttb);
        getnext(lfb,fb,nexttfb);
        if(strcmp(b,"0")==0)
            cout<<"Alice"<<endl;
        else if(la<lb)
            cout<<"Bob"<<endl;
        else if(KMP(la,lb,b,nexttb)==1||KMP(la,lfb,fb,nexttfb)==1)
            cout<<"Alice"<<endl;
        else cout<<"Bob"<<endl;
    }
    return 0;
}