POJ 3280-区间DP

题目链接

DP[i][j] 表示区间i到j变成回文串的代价

当DP[i+1][j]区间i+1到j是回文串时第i个字符可以添加也可以删除选取最小的代价，DP[i][j-1]也是一样

#include <iostream>  
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <string>
#include <string.h>
#include <cmath>
#include <sstream>
#include <set>
#include <map>
#include <functional>
#include <queue>
#include <vector>
using namespace std;

const int maxn = 2000, INF = 1e9 + 7;
int N, M, a, d, len;
int cost[maxn], dp[maxn][maxn];
char ch;
string str;

int main()
{
    cin >> N >> M >> str;
    for (int i = 0; i < N; i++)
    {
        cin >> ch >> a >> d;
        cost[ch - 'a'] = min(a, d);
    }
    len = str.length();
    memset(dp, 0, sizeof(dp));

    for (int i = len - 1; i >= 0; i--)
    {
        for (int j = i + 1; j < len; j++)
        {
            dp[i][j] = INF;
            if (str[i] == str[j])
                dp[i][j] = dp[i + 1][j - 1];
            else
                dp[i][j] = min(dp[i + 1][j] + cost[str[i] - 'a'], dp[i][j - 1] + cost[str[j] - 'a']);//转移方程
        }
    }
    cout << dp[0][len - 1];
}