poj 3267

dp问题，采用老办法，递归版本之后加记录。

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <map>
#include <algorithm>
#include <list>
#include <ctime>
#include <set>
#include <cstring>
#include <queue>
#include <cstdio>
#define CLR(arr, what) memset(arr, what, sizeof(arr))
const int MAX = 100005;
const int maxc = 1500;
using namespace std;
string dict[602];
int dp[302];
int w, l;
string message;
int count(int pos, int wordnum) {
    int i, res, j;
    j = dict[wordnum].size() - 1;
    for (i = pos; i >= 0; i--) {
        if (message[i] == dict[wordnum][j]) {
            j--;
        }
        if (j < 0) {
            return i;
        }
    }
    return -1;
}
int dfs(int cur) {
    if (cur < 0)
        return 0;
    if (dp[cur] != -1) {
        return dp[cur];
    }
    int j, num_de, remain, szw;
    int res = maxc;
    for (int i = 0; i < w; i++) {
        num_de = count(cur, i);
        szw = dict[i].size();
        if (num_de >= 0) {
            remain = dfs(num_de - 1);
            res = min(res, cur - num_de + 1 - szw + remain);
        } else {
            remain = (cur + 1);
            res = min(res, remain);
        }
    }
    dp[cur] = res;
    return res;
}
int main() {
    while (scanf("%d%d", &w, &l) != EOF) {
        cin >> message;
        for (int i = 0; i < w; i++) {
            cin >> dict[i];
        }
        for (int i = 0; i < 302; i++) {
            dp[i] = -1;
        }
        cout << dfs(l - 1) << endl;
    }
    return 0;
}

from kakamilan