BZOJ4259: 残缺的字符串

一直在想各种字符串匹配算法…

将’a’视为1，’b’视为2，‘*’视为0
那么$A_0......A_n$和$B_k.....B_{k+n-1}$ 匹配的条件就是
$\sum_{j=0}^n(A_j-B_{k+j})^2A_jB_{k+j}=0$
将B翻转就是个fft的形式…..

怎么还卡常啊

code：

#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;

const int maxn = 1048576;
const double pi=acos(-1);
const double eps=1.0;

struct E
{
    double x,y;
    friend inline E operator +(const E a,const E b){return (E){a.x+b.x,a.y+b.y};}
    friend inline E operator -(const E a,const E b){return (E){a.x-b.x,a.y-b.y};}
    friend inline E operator *(const E a,const E b){return (E){a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x};}
}a1[maxn],a2[maxn],a3[maxn],b1[maxn],b2[maxn],b3[maxn];
int id[maxn],N,ln;
void pre(int n)
{
    N=1,ln=0; while(N<=(n<<1)) N<<=1,ln++;
    for(int i=1;i<N;i++) id[i]=id[i>>1]>>1|(i&1)<<ln-1;
}
void DFT(E f[],int sig)
{
    for(int i=0;i<N;i++) if(i<id[i]) swap(f[i],f[id[i]]);
    for(int m=2;m<=N;m<<=1)
    {
        int t=m>>1;
        E wn=(E){cos(2*pi/m),sin(2*pi*sig/m)};
        for(int j=0;j<N;j+=m)
        {
            E w0=(E){1,0};
            for(int i=0;i<t;i++)
            {
                E tx=f[j+i],ty=f[j+i+t]*w0;
                f[j+i]=tx+ty;
                f[j+i+t]=tx-ty;
                w0=w0*wn;
            }
        }
    }
    if(sig==-1) for(int i=0;i<N;i++) f[i].x/=(double)N;
}
int n,m;

char A[maxn],B[maxn];
int a[maxn],b[maxn];
int ans[maxn],an;

int main()
{
    //freopen("tmp.in","r",stdin);
    //freopen("tmp.out","w",stdout);

    scanf("%d%d",&m,&n);
    scanf("%s",A); scanf("%s",B);
    for(int i=0;i<m;i++) a[i]=A[i]=='*'?0:A[i]-'a'+1;
    for(int i=0;i<n;i++) b[n-i]=B[i]=='*'?0:B[i]-'a'+1;
    for(int i=0;i<m;i++) a1[i].x=a[i],a2[i].x=-2.0*a[i]*a[i],a3[i].x=a[i]*a[i]*a[i];
    for(int i=0;i<n;i++) b1[i].x=b[i],b2[i].x=b[i]*b[i],b3[i].x=b[i]*b[i]*b[i];
    pre(n);
    DFT(a1,1); DFT(a2,1); DFT(a3,1);
    DFT(b1,1); DFT(b2,1); DFT(b3,1);
    for(int i=0;i<N;i++)
    {
        a1[i]=a1[i]*b3[i];
        a1[i]=a1[i]+a2[i]*b2[i];
        a1[i]=a1[i]+a3[i]*b1[i];
    }
    DFT(a1,-1);
    for(int i=0;i+m-1<n;i++)
        if(fabs(a1[n-i].x)<eps) ans[++an]=i;
    printf("%d\n",an);
    for(int i=1;i<=an;i++) printf("%d ",ans[i]+1);

    return 0;
}