uva 11584（动态规划起步第四天 线性DP）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

#define REP(i,N) for (int i = 0;i < (N);i++)
#define REP_1(i,N) for (int i = 1;i < (N);i++)
#define REP_2(i,be,en) for (int i = (be);i < (en);i++)
#define DWN(i,N) for (int i = N;i >= 0;i--)
#define INF 0x3f3f3f3f
#define MAXN 1010
using namespace std;

char str[MAXN];
int dp[MAXN];

bool is_palindromes(int i,int j) {
if (i >= j) return 1;
if (str[i] == str[j]) return is_palindromes(i + 1,j - 1);
else return 0;
}

int main () {
int T;
freopen("1.txt","r",stdin);
cin >> T;
while (T--) {
scanf("%s",str + 1);
int len = strlen(str + 1);
REP(i,len + 1) {
dp[i] = i;
REP(j,i) {
if (is_palindromes(j + 1,i)) {
dp[i] = min(dp[j] + 1,dp[i]);
}
}
}
cout << dp[len] << endl;
}
}