神奇的程序

#include <bits/stdc++.h>
using namespace std;
int dp[52][52];
char wood[53];

int solve1(int front, int back) {
	if (dp[front][back] != 0) {
		return dp[front][back];
	}
	if (back - front == -1)
		return 0;
	if (back == front)
		return 1;
	if (wood[front] == wood[back]) {
		dp[front][back] = solve1(front + 1, back - 1) + 1;
	}
	if (dp[front][back] == 0) {
		dp[front][back] = 1000000;
	}
	for (int i = 0; i < back - front; i++) {
		dp[front][back] = min(dp[front][back], solve1(front, front + i) + solve1(front + i + 1, back));
	}
	return dp[front][back];
}
int main() {
    // 初始化 dp 数组
    memset(dp, 0, sizeof(dp));

    // 使用 getline 读取整行输入
    string input;
    getline(cin, input);
    int a = 0;
    for(int i = 0;i < input.size();i++) {
        wood[a] = input[i];
		if (wood[a] > 'Z' || wood[a] < 'A') {
			a--;
			break;
		}
		if (wood[a - 1] == wood[a++]) {
			--a;
		}
	}
	cout << solve1(0, a);
}