传送门

独立做出来的第一道区间DP题目
个人感觉不难

//MADE BY Y_is_sunshine;
//#include <bits/stdc++.h>
//#include <memory.h>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define INF 0x3f3f3f3f
#define MAXN 305
const int mod = 1e9 + 7;

using namespace std;

int dp[MAXN][MAXN];

int N;
string s1;

int main()
{

	freopen("data.txt", "r", stdin);

	cin >> s1;
	N = s1.size();
	s1.insert(s1.begin(), ' ');
	memset(dp, 0x3f, sizeof(dp));
	for (int i = 1; i <= N; i++)
		dp[i][i] = 1;
	for (int len = 1; len < N; len++) {
		for (int i = 1; i + len <= N; i++) {
			int j = i + len;
			if (s1[i] == s1[j])
				dp[i][j] = dp[i][j - 1];
			for (int k = i; k < j; k++)
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);
		}
	}
	
	cout << dp[1][N] << endl;

	freopen("CON", "r", stdin);
	system("pause");
	return 0;
}