uva 11584 动规

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 5;
int  kase, d[maxn], T;
bool vis[maxn][maxn], p[maxn][maxn];
string str;
int is_palindrome(int i, int j)
{
	if (i >= j) return 1;
	if (str[i - 1] != str[j - 1]) return 0;
	if (vis[i][j]) return p[i][j];
	vis[i][j] = 1;
	return p[i][j] = is_palindrome(i + 1, j - 1);
}
int solve()
{
	d[0] = 0;
	for (int i = 1; i <= str.size(); i++)
	{
		d[i] = i + 1;
		for (int j = 0; j < i; j++)
			if (is_palindrome(j + 1, i))
				d[i] = min(d[i], d[j] + 1);
	}
	return d[str.size()];
}
int main(int argc, char const *argv[])
{
	cin >> T;
	while (T--)
	{
		cin >> str;
		memset(vis, 0, sizeof(vis));
		cout << solve() << endl;
	}
	return 0;
}

预处理判断回文的函数很有意思