记录编号	602945	评测结果	AAAAAAAAAA
题目名称	2034.[Tyvj]方块消除	最终得分	100
用户昵称	LikableP	是否通过	通过
代码语言	C++	运行时间	0.961 s
提交时间	2025-07-07 19:50:17	内存使用	8.33 MiB

#include <cstdio>

template <typename T> T read();
template <typename T> void write(T, char);
template <typename T> T max(T, T);

int n, m;
int a[210], b[210], c[210];
long long f[210][210][210];

int main() {
  freopen("eliminate.in", "r", stdin);
  freopen("eliminate.out", "w", stdout);
  n = read<int>();
  for (int i = 1; i <= n; ++i) {
    a[i] = read<int>();
    if (a[i] != a[i - 1]) {
      b[++m] = a[i];
      c[m] = 1;
    } else {
      ++c[m];
    }
  }

  for (int i = 1; i <= m; ++i) {
    for (int k = 0; k <= n; ++k) {
      f[i][i][k] = (c[i] + k) * (c[i] + k);
    }
  }

  for (int len = 2; len <= m; ++len) {
    for (int l = 1; l <= m - len + 1; ++l) {
      int r = l + len - 1;
      for (int k = 0; k <= n; ++k) {
        f[l][r][k] = f[l][r - 1][0] + (c[r] + k) * (c[r] + k);
        for (int x = l; x < r; ++x) {
          if (b[x] == b[r]) {
            f[l][r][k] = max(f[l][r][k], f[l][x][c[r] + k] + f[x + 1][r - 1][0]);
          }
        }
      }
    }
  }

  write(f[1][m][0], '\n');
  return 0;
}

template <typename T> T max(T x, T y) {
  return x > y ? x : y;
}

#define isdigit(ch) (ch >= '0' && ch <= '9')
template <typename T> T read() {
  T res = 0, f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
  return res * f;
}
#undef isdigit

template <typename T> void write(T x, char ed) {
  if (x < 0) x = -x, putchar('-');
  int sta[sizeof(T) << 2], top = 0;
  do {
    sta[++top] = x % 10;
    x /= 10;
  } while (x);
  while (top) {
    putchar(sta[top--] ^ 48);
  }
  putchar(ed);
}