uva 11584 Partitioning by Palindromes

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
const int INF = 0xfffffff;
const double ESP = 10e-8;
const double Pi = atan(1) * 4;
const int MOD = 1000007;
const int MAXN = 1000 + 10;
typedef long long LL;
using namespace std;

char str[MAXN];
bool isPart[MAXN][MAXN];
int dp[MAXN];
int main(){
    //freopen("input.txt","r",stdin);
    int n;
    scanf("%d",&n);
    while(n--){
        scanf("%s",str);
        memset(isPart,0,sizeof(isPart));
        int len = strlen(str);
        for(int i = 0;i < len;i++){
            for(int j = i;j < len;j++){
                bool flag = 1;
                for(int k = 0;k <= (j-i)/2;k++){
                    if(str[k+i] != str[j-k]){
                        flag = 0;
                        break;
                    }
                }
                if(flag){
                    isPart[i+1][j+1] = isPart[j+1][i+1] = 1;
                }
            }
        }
        for(int i = 1;i <= len;i++){
            dp[i] = INF;
        }
        dp[1] = 1;
        for(int i = 1;i <= len;i++){
            for(int j = 0;j < i;j++){
                if(isPart[j+1][i]){
                    dp[i] = min(dp[i],dp[j]+1);
                }
            }
        }
        printf("%d\n",dp[len]);
    }
    return 0;
}