f[i][j][s][t]表示第i个字符到第j个字符能否匹配到第s个串的第t个字符
f[i][j][k][t]=(f[i][j-1][k][t-1] && S[j]==s[k][t])||(f[i][d][k][t] && c[d+1][j])
c[i][j]表示i到j是否能全部删除
倒序枚举i转移
f[i][j][k][t]=(f[i][j-1][k][t-1] && S[j]==s[k][t])||(f[i][d][k][t] && c[d+1][j])
c[i][j]表示i到j是否能全部删除
倒序枚举i转移
好神的dp,感觉自己完全不会dp了
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
bool f[210][210][31][21],c[210][210];
int dp[210],len[31];
char S[210],s[40][30];
int n,m;
int main()
{
scanf("%s",S+1);
m=strlen(S+1);
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%s",s[i]+1);
len[i]=strlen(s[i]+1);
}
for (int i=m;i>=1;i--)
for (int j=i;j<=m;j++)
{
for (int k=1;k<=n;k++)
{
f[i][i-1][k][0]=1;
for (int t=1;t<=len[k];t++)
{
f[i][j][k][t]=(f[i][j-1][k][t-1] && S[j]==s[k][t]);
for (int d=i;d<j;d++) f[i][j][k][t]|=(f[i][d][k][t] && c[d+1][j]);
}
}
for (int k=1;k<=n;k++) c[i][j]|=f[i][j][k][len[k]];
}
for (int i=1;i<=m;i++)
{
dp[i]=dp[i-1]+1;
for (int j=1;j<=i;j++) if (c[j][i]) dp[i]=min(dp[i],dp[j-1]);
}
printf("%d\n",dp[m]);
return 0;
}