两种情况:1.找到相似方块直接消去
2.将中间方块枚举消去,两边方块可以累计平方更大。
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
#include<stdio.h>
#include<string>
#include<vector>
#include<queue>
#include<map>
#include<sstream>
#include<cassert>
using namespace std;
const int maxn = 200 + 5;
int n, A[maxn], d[maxn][maxn][maxn];
int dp(int i, int j, int k) {
if (i > j)return 0;
int &ans = d[i][j][k];
if(ans>0)return ans;
int p = j;
while (p >= i && A[p] == A[j])p--;
p++;
ans = dp(i, p - 1, 0) + (j - p + k + 1)*(j - p + k + 1);
for (int q = i; q < p; q++) {
if (A[q] == A[j] && A[q] != A[q + 1]) {
ans = max(ans, dp(q + 1, p - 1, 0) + dp(i, q, j - p + k + 1));
}
}
return ans;
}
int main() {
int T;
scanf("%d", &T);
for (int kase = 1; kase <= T; kase++) {
scanf("%d", &n);
for (int i = 0; i < n; i++)scanf("%d", &A[i]);
memset(d, -1, sizeof(d));
printf("Case %d: %d\n", kase, dp(0, n - 1, 0));
}
return 0;
}