bzoj 3530: [Sdoi2014]数数

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #define M 1509
 #define MO 1000000007
 #define ll long long
 using namespace std;
 char a[M];
 int b[M],c[M],n,shu[M][],tot=,m,n1,fail[M],q[M],f[][][];
 ll ans;
 bool bo[M];
 void dp(int a1)
 {
     for(int i=;i<=tot;i++)
       for(int l=;l<=;l++)
        {
         if(bo[i]||!f[a1-][i][l])
           continue;
         for(int j=;j<=;j++)
           {
             int k=i;
             for(;!shu[k][j];k=fail[k]);
               f[a1][shu[k][j]][l+j>b[a1]]=(f[a1][shu[k][j]][l+j>b[a1]]+f[a1-][i][l])%MO;
             if(!j)
               f[a1][shu[k][j]][]=(f[a1][shu[k][j]][]+f[a1-][i][l])%MO;
           }
        }
     return;
 }
 int main()
 {
     scanf("%s",a+);
     n=strlen(a+);
     for(int i=;i<=n;i++)
       b[n-i+]=a[i]-'';
     scanf("%d",&m);
     for(int i=;i<=m;i++)
       {
         scanf("%s",a+);
         n1=strlen(a+);
         for(int j=;j<=n1;j++)
           c[n1-j+]=a[j]-'';
         int now=;
         for(int j=;j<=n1;j++)
           if(shu[now][c[j]])
             now=shu[now][c[j]];
           else
             {
                 shu[now][c[j]]=++tot;
                 now=tot;
             }
         bo[now]=;
       }
     for(int i=;i<=;i++)
       shu[][i]=;
     int h=,t=;
     q[]=;
     for(;h<t;)
       {
         h++;
         int p=q[h];
         for(int i=;i<=;i++)
           if(shu[p][i])
             {
                 q[++t]=shu[p][i];
                 int k=fail[p];
                 for(;!shu[k][i];k=fail[k]);
                 fail[shu[p][i]]=shu[k][i];
             }
       }
     f[][][]=;
     for(int i=;i<=n;i++)
       dp(i);
     for(int i=;i<n;i++)
       for(int j=;j<=tot;j++)
         if(!bo[j])
           ans=(ans+(ll)f[i][j][]+f[i][j][]-f[i][j][])%MO;
     for(int i=;i<=tot;i++)
       if(!bo[i])
         ans=(ans+f[n][i][]-f[n][i][])%MO;
     printf("%lld\n",ans);
     return ;
 }

AC自动机上跑数位DP