原文链接:https://www.luogu.com.cn/problem/P3146
AC代码:
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;
int n,mapp[505],dp[505][505],sum[505],maxn=0;
int main(){
int i,j,p;
cin>>n;
memset(mapp,0,sizeof(mapp));
memset(dp,0,sizeof(dp));
memset(sum,0,sizeof(sum));
for(i=1;i<=n;i++){
cin>>mapp[i];
sum[i]=sum[i-1]+mapp[i];
dp[i][i]=mapp[i];
maxn=max(maxn,dp[i][i]);
}
for(int len=1;len<n;len++){
for(i=1;i+len<=n;i++){
j=i+len;
for(int k=i;k<j;k++){
if(dp[i][k]==dp[k+1][j]) dp[i][j]=max(dp[i][j],dp[i][k]+1);
maxn=max(maxn,dp[i][j]);
}
}
}
cout<<maxn<<endl;
return 0;
}