[USACO16OPEN]248

传送门啦

分析：

一个裸的区间dp，我们只需要注意合并的时候并不像2048那样加倍，每次都加1就好了

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = ;

inline int read(){
    int f =  , x = ;
    char ch = getchar();
    while(ch > '' || ch < '') {if(ch == '-') f = -; ch = getchar();}
    while(ch >= '' && ch <= ''){x = (x << ) + (x << ) + ch - ''; ch = getchar();}
    return x * f;
}

int n,m;
int f[maxn][maxn],ans;

int main(){
    n = read();
    for(int i=;i<=n;i++)  f[i][i] = read() , ans = max(ans , f[i][i]);
    for(int i=n;i>=;i--)
       for(int j=i+;j<=n;j++)
          for(int k=i;k<=j;k++)
             if(f[i][k] == f[k+][j]){
                f[i][j] = max(f[i][j] , f[i][k] + );
                ans = max(ans , f[i][j]);
            }
    printf("%d",ans);
    return ;
}