Modern Art 3

#include <bits/stdc++.h>

using namespace std;

const int N = 300 + 9;

int rangeDP[N][N], A[N];

int main () {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> A[i];
    for (int i = 1; i <= n; i++)
        rangeDP[i][i] = 0;
    for (int len = 2; len <= n; len++) {
        for (int i = 1; i + len - 1 <= n; i++) {
            int j = i + len - 1;
            rangeDP[i][j] = rangeDP[i][j - 1];
            for (int k = i; k < j; k++)
                if (A[k] == A[j])
                    rangeDP[i][j] = max (rangeDP[i][j], rangeDP[k + 1][j - 1] + rangeDP[i][k] + 1);
        }
    }
    cout << n - rangeDP[1][n] << "\n";
    return 0;
}