NOIP 2015 子串

借鉴大神思路。。。

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<iostream>
 #include<queue>
 #include<stack>
 #include<cmath>
 #include<algorithm>
 #include<malloc.h>
 using namespace std;
 #define clc(a,b) memset(a,b,sizeof(a))
 #define inf 0x3f3f3f3f
 const int N=;
 #define LL long long
 const double eps = 1e-;
 const double pi = acos(-);
  int g[][];
 // inline int r(){
 //     int x=0,f=1;char ch=getchar();
 //     while(ch>'9'||ch<'0'){if(ch=='-') f=-1;ch=getchar();}
 //     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
 //     return x*f;
 // }
  const LL mod = ;
 int f[][][];
 int tem[][][];
 char s1[],s2[];
 int main(){
     // freopen("in.txt","r",stdin);
     int n,m,K;
     scanf("%d%d%d",&n,&m,&K);getchar();
     scanf("%s",s1+);getchar();
     scanf("%s",s2+);
     f[][][]=,tem[][][]=;
     for(int i=;i<=n;i++){
         tem[][i][]=;
     }
     for(int k=;k<=K;k++){
         clc(tem[k&],);
         clc(f[k&],);
         for(int i=;i<=n;i++){
              for(int j=;j<=m;j++){
                 if(s1[i]==s2[j]){
                     f[k&][i][j]=tem[(k-)&][i-][j-]%mod;
                     if(s1[i-]==s2[j-]){
                         f[k&][i][j]=(f[k&][i][j]+f[k&][i-][j-])%mod;
                     }
                 }
                 tem[k&][i][j]=(tem[k&][i][j]+f[k&][i][j]+tem[k&][i-][j])%mod;
              }
         }
     }
     int ans=;
     for(int i=;i<=n;i++){
         ans=(ans+f[K&][i][m])%mod;
     }
     printf("%d\n",ans);
     return ;
 }