wenbao与回文串dp

http://oj.jxust.edu.cn/problem.php?id=1432

#include <iostream>
#include <string.h>
using namespace std;

char str[1009];
int dp[1009][1009];

int main(){
    int t;
    scanf("%d", &t);
    while(t--){
        scanf("%s", str+1);
        int len = strlen(str+1);
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= len; ++i){
            for(int j = i-1; j > 0; --j){
                if(str[i] == str[j]){
                    dp[j][i] = dp[j+1][i-1];
                }else{
                    dp[j][i] = min(dp[j+1][i-1]+2, min(dp[j+1][i]+1, dp[j][i-1]+1));
                }
            }
        }
        printf("%d
", dp[1][len]);
    }
    return 0;
}

只有不断学习才能进步！