poj 3276 The Cow Lexicon

好蛋疼啊！今天被人完爆了！

/*
 * Author: stormdpzh
 * POj: 3276 The Cow Lexicon
 * Time: 2012/4/29 19:14:12
 */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <functional>

#define sz(v) ((int)(v).size())
#define rep(i, n) for(int i = 0; i < n; i++)
#define repf(i, a, b) for(int i = a; i <= b; i++)
#define out(n) printf("%d\n", n)
#define wh(n) while(scanf("%d", &n) != EOF)
#define whz(n) while(scanf("%d", &n) != EOF && n != 0)
#define int64 long long

using namespace std;

string dic[605];
string str;
int len[605];
int w, l;
int dp[305];

int main()
{
    //freopen("data.in", "r", stdin);
    while(scanf("%d%d", &w, &l) != EOF) {
        cin >> str;
        rep(i, w)
            cin >> dic[i];
        repf(i, 1, l) {
            dp[i] = i;
            repf(j, 0, w - 1)
                len[j] = sz(dic[j]) - 1;
            for(int j = i - 1; j >= 0; j--) {
                rep(k, w) {
                    if(len[k] >= 0 && dic[k][len[k]] == str[j])
                        len[k]--;
                    if(len[k] < 0)
                        dp[i] = min(dp[i], dp[j] + i - j - sz(dic[k]));
                }
            }
        }
        out(dp[l]);
    }
    return 0;
}