uva11584 划分成回文串

d[i] 为1 ~i划分成最小回文串的个数，那么d[i]  = min(dp[i], dp[j-1]+1 | [j ~ i] 是回文串)

所以需要O(n^3)的时间

/***********************************************
 * Author: fisty
 * Created Time: 2015/2/12 18:09:05
 * File Name   : uva11584.cpp
 *********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 1100
char str[MAX_N];
int s[MAX_N][MAX_N]; //s[i..j]是不是回文串
int dp[MAX_N];      //字符0~i划分成回文串的最小个数
bool check(int l, int r){
    for(int i = l, j = r; i <= r; i++, j--){
        if(str[i] != str[j]){
            return false;
        }
    }
    return true;
}
int main() {
    //freopen("in.cpp", "r", stdin);
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--){
        scanf("%s", str+1);
        Memset(dp, 0x3f);
        dp[0] = 0;
        int len = strlen(str+1);
        for(int i = 1;i <= len; i++){
            for(int j = 1;j <= i; j++){
                if(check(j, i)){
                    dp[i] = min(dp[i], dp[j-1]+1);
                }
            }
        }
        cout << dp[len] << endl;
    }
    return 0;
}