类似于消箱子游戏,采取最优策略使得分最高
先预处理分块;
score[i][j][k]表示假设j块的右边有一个长度为k的同色块,则将i到j以及k消除能得到的最高分;i]i
如何求score[i][j][k]:
假设j与k合并为Q,则:
1):直接消除Q,得分click(i,j-1,0)+(s[j].len+len)^2;
2):Q能与左边的第K块合并,枚举K; 得分click(i,k,s[j].len+len) + click(k+1,j-1,0)
取大值;
终止条件i==j;
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<vector>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<stack>
#include<memory.h>
#include<ctype.h>
using namespace std;
typedef long long ll;
const int maxn(200+10);
int n;
struct box{
int color;
int len;
};
box s[maxn];
int score[maxn][maxn][maxn];
int click(int i,int j,int len){
if(score[i][j][len]!=-1)return score[i][j][len];
int result=(s[j].len+len)*(s[j].len+len);
if(i==j)return result;
result+=click(i,j-1,0);
for(int k=i;k<=j-1;k++){
if(s[k].color!=s[j].color)continue;
int r=click(k+1,j-1,0);
r+=click(i,k,s[j].len+len);
result=max(r,result);
}
score[i][j][len]=result;
return result;
}
int main(){
int cas;
cin>>cas;
for(int kk=1;kk<=cas;kk++){
cin>>n;
memset(score,0Xff,sizeof(score));
int lastc=0;
int lastnum=-1;
for(int i=1;i<=n;i++){
int c;
cin>>c;
if(c!=lastc){
lastnum++;
s[lastnum].len=1;
s[lastnum].color=c;
lastc=c;
}
else s[lastnum].len++;
}
cout<<"Case "<<kk<<": "<<click(0,lastnum,0)<<endl;
}
return 0;
}