HNU 12501 Genetic Fraud

枚举模式串起点，完整匹配一半长度。

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;

#define   mark(a) cout<<"a"<<endl;

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))

const int MAXV = 1200;

int next[MAXV];

bool KMP(string p,string t)
{
    next[0]=-1;
    for(int i=0,j=-1;p.length()>i;)
    {
        if(j==-1||p[i]==p[j]) next[++i]=++j;
        else j=next[j];
    }
    for(int i=0,j=-0;t.length()>i;)
    {
        if(j==-1||abs(t[i]-p[j])<=1)
        {
            i++;
            j++;
            if(j==p.length()) return true;
        }
        else j=next[j];
    }
    return false;
}

string a,b;
int tcase,n,l;

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Genetic Fraud.txt","r",stdin);
    #endif

    cin>>tcase;while(tcase--)
    {
        cin>>l>>a>>b;
        bool flag=false;
        for(int i=0,m=(l+1)/2;l>=i+m;i++)
        {
            if(KMP(a.substr(i,m),b))
            {
                flag=true;
                break;
            }
        }
        cout<<(flag?"POSITIVE":"NEGATIVE")<<endl;
    }
    return 0;
}

或者直接LCS。

#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>

using namespace std;

#pragma pack(4)

const double  eps = 1e-8;
const double   pi = acos(-1.0);
const int     inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;

#define   mark(a) cout<<"a"<<endl;

#define   at(a,i) ((a)&(1<<(i)))
#define   nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))

#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)

#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))

const int MAXV = 1200;

string a,b;
int tcase,l,dp[MAXV][MAXV];

bool similar(char a,char b)
{
    return abs(a-b)<=1;
}

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("Genetic Fraud.txt","r",stdin);
    #endif

    cin>>tcase;while(tcase--)
    {
        cin>>l>>a>>b;
        memset(dp,0,sizeof(dp));

        bool flag=false;
        for(int i=1;l>=i;i++)
        {
            for(int j=1;l>=j;j++)
            {
                if(similar(a[i-1],b[j-1])) dp[i][j]=dp[i-1][j-1]+1;
                else dp[i][j]=0;
                if(dp[i][j]>=(l+1)/2)
                {
                    flag=true;
                    i=j=l+1;
                }
            }
        }
        if(flag) cout<<"POSITIVE"<<endl;
        else cout<<"NEGATIVE"<<endl;
    }
    return 0;
}