[luoguP2875] [USACO07FEB]牛的词汇The Cow Lexicon（DP）

传送门

f[i] 表示前 i 个字符去掉多少个 的最优解

直接暴力DP

——代码

#include <cstdio>
#include <cstring>
#include <iostream>

int n, m, cnt, f[301];
char s[301], a[601][26];

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
    for(; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + ch - '0';
    return x * f;
}

inline int min(int x, int y)
{
    return x < y ? x : y;
}

int main()
{
    int i, j, k, l;
    n = read();
    m = read();
    scanf("%s", s + 1);
    for(i = 1; i <= n; i++) scanf("%s", a[i] + 1);
    for(i = 1; i <= m; i++)
    {
        f[i] = i;
        for(j = 1; j <= n; j++)
        {
            cnt = 0;
            l = strlen(a[j] + 1);
            for(k = i; k; k--)
            {
                if(a[j][l] == s[k]) l--;
                else cnt++;
                if(!l) break;
            }
            if(k) f[i] = min(f[i], f[k - 1] + cnt);
        }
    }
    printf("%d
", f[m]);
    return 0;
}