POJ3280-区间dp或递推-Cheapest Palindrome

https://vjudge.net/problem/POJ-3280
给定一个串，再给你n个字母
和这n个字母 添加和 删除的话费，
问这个串变成回文串的最小花费

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
/*dp[i][j]=

*/
const int maxn=3002;
 int dp[maxn][maxn];
    int cost[30];
int main()
{
    int m,n;
    string s;
    char c;
    int a,b;
    while(~scanf("%d%d",&m,&n)){
         cin>>s;
         memset(cost,0,sizeof(cost));
         for(int i=1;i<=m;i++){
            cin>>c>>a>>b;
            cost[c-'a']=min(a,b);
         }
         memset(dp,0,sizeof(dp));
         for(int i=n-1;i>=0;i--){
            for(int j=i+1;j<=n-1;j++)
            {  dp[i][j]=min(dp[i][j-1]+cost[s[j]-'a'],dp[i+1][j]+cost[s[i]-'a']);
                if(s[i]==s[j])
             dp[i][j]=min(dp[i][j],dp[i+1][j-1]);
            }
         }
         printf("%d\n",dp[0][s.size()-1]);
    }
    return 0;
}

区间dp

#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 200;
const int M = 2500;
int add[N];
int dp[M][M];

int main()
{
    int n,m;
    string s;
    while(~scanf("%d%d",&n,&m))
    {
        cin>>s;
        char c;int x,y;
        for(int i=0;i<n;i++)
        {
            cin>>c>>x>>y;
            add[c]=min(x,y);
        }
        memset(dp,0,sizeof(dp));
        for(int k=1;k<m;k++)
        {
            for(int i=0,j=k;j<m;i++,j++)
            {
                dp[i][j]=0x3f3f3f3f;
                if(s[i]==s[j])
                    dp[i][j]=dp[i+1][j-1];
                else
                {
                    dp[i][j]=min(dp[i+1][j] + add[s[i]],dp[i][j]);
                    dp[i][j]=min(dp[i][j-1] + add[s[j]],dp[i][j]);
                }
            }
        }
        printf("%d\n",dp[0][m-1]);
    }
    return 0;
}