Light oj 1044

题目链接：http://lightoj.com/volume_showproblem.php?problem=1044

dp[i][j]表示i到j直接的最小回文区间个数，直接看代码

#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int dp[N][N], inf = 1e9;
char str[N];
bool judge(int l, int r) {
    for(int i = l - 1, j = r - 1; i < j; ++i, --j) {
        if(str[i] != str[j])
            return false;
    }
    return true;
}
int dfs(int l, int r) {
    if(l == r)
        return dp[l][l] = 1;
    if(l > r)
        return 0;
    if(dp[l][r] < inf)
        return dp[l][r];
    int ans = inf;
    for(int i = r; i >= l; --i) {
        if(judge(i, r))
            ans = min(ans, dfs(l, i - 1) + 1);
    }
    return dp[l][r] = ans;
}

int main()
{
    int t;
    scanf("%d", &t);
    for(int ca = 1; ca <= t; ++ca) {
        scanf("%s", str);
        int len = strlen(str);
        for(int i = 1; i <= len; ++i) {
            for(int j = 1; j <= len; ++j) {
                dp[i][j] = inf;
            }
        }
        printf("Case %d: %d
",ca, dfs(1, len));
    }
    return 0;
}