题目大意
求一个只由小写字母组成的长度为n的字符串中,有多少个不包含给定字符串的?
DP
我们可以考虑KMP
再处理nexti,c表示指针在第i个位置时接收字符c指针会移动到哪
fi,j表示填到第i个位置,目前指针为j
然后就可以转移
#include<cstdio>
#include<algorithm>
#include<cstring>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=10000+10,maxm=100+10,mo=1000000007;
int fail[maxm],next[maxm][26],f[maxn][maxm];
int i,j,k,l,t,n,m,ans;
char s[maxm],ch;
bool czy;
int main(){
freopen("helloworld.in","r",stdin);freopen("helloworld.out","w",stdout);
while (scanf("%d",&n)!=EOF){
scanf("%s",s+1);
m=strlen(s+1);
czy=1;
fo(i,1,m)
if (s[i]<'a'||s[i]>'z'){
czy=0;
break;
}
if (!czy){
ans=1;
fo(i,1,n) ans=(ll)ans*26%mo;
printf("%d\n",ans);
continue;//not break
}
j=0;
fail[1]=0;
fo(i,2,m){
while (j&&s[j+1]!=s[i]) j=fail[j];
if (s[j+1]==s[i]) j++;
fail[i]=j;
}
fo(i,0,m-1){
fo(k,0,25){
j=i;
ch='a'+k;
while (j&&s[j+1]!=ch) j=fail[j];
if (s[j+1]==ch) j++;
next[i][k]=j;
}
}
/*fo(i,0,25) next[0][i]=0;
next[0][s[1]-'a']=1;
fo(i,0,m-1)
fo(k,0,25){
j=i;
ch='a'+k;
if (s[j+1]==ch) j++;else j=next[fail[j]][k];
next[i][k]=j;
}*/
fo(i,0,n)
fo(j,0,m)
f[i][j]=0;
f[0][0]=1;
fo(i,0,n-1)
fo(j,0,m-1)
if (f[i][j])
fo(k,0,25){
t=next[j][k];
//(f[i+1][t]+=f[i][j])%=mo;
f[i+1][t]=(f[i+1][t]+f[i][j])%mo;
//if (f[i+1][next[j][k]]>=mo) f[i+1][next[j][k]]%=mo;
}
ans=0;
fo(i,0,m-1) /*(ans+=f[n][i])%=mo;*/ans=(ans+f[n][i])%mo;
printf("%d\n",ans);
}
}