Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #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 len = 2; len <= n; len++) {
- for (int i = 1; i + len - 1 <= n; i++) {
- int j = i + len - 1;
- if (A[i] == A[j])
- rangeDP[i][j] = 1 + rangeDP[i + 1][j - 1];
- for (int k = i + 1; k < j; k++)
- rangeDP[i][j] = max (rangeDP[i][j], rangeDP[i][k] + rangeDP[k][j]);
- }
- }
- cout << n - rangeDP[1][n] << "\n";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement