#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 201;
int d[maxn][maxn][maxn],a[maxn],n;
bool vis[maxn][maxn][maxn];
int dp(int i,int j,int k){
if(vis[i][j][k]) return d[i][j][k];
vis[i][j][k] = true;
int& ans = d[i][j][k];
int p,q;
for(p = j;p>=i;p--) if(a[p]!=a[j]) {p++; break;}
if(p==i-1) p++;
if(p==i) return ans = (j - p + 1 + k)*(j - p + 1 ......
阅读全文