Link
Solution
f i j f_{ij} fij表示区间 [ i , j ] [i,j] [i,j]的数能缩成几,如果不能缩起来的话 f i j = 0 f_{ij}=0 fij=0
最后再一次 d p dp dp, d p i dp_i dpi表示前 i i i个数最少能缩成几块, d p n dp_n dpn就是答案
Code
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll f[maxn][maxn], n, a[maxn], dp[maxn];
int main()
{
ll i, j, k, len;
n = read();
rep(i,1,n)a[i] = read();
rep(i,1,n)f[i][i]=a[i];
rep(len,2,n)rep(i,1,n-len+1)
{
ll j = i+len-1;
rep(k,i,j-1)
{
if(f[i][k]==f[k+1][j] and f[i][k])f[i][j]=f[i][k]+1;
}
}
rep(i,1,n)dp[i]=linf;
rep(i,1,n)rep(j,1,i)
{
if(f[i-j+1][i])dp[i] = min(dp[i],dp[i-j]+1);
}
printf("%lld",dp[n]);
return 0;
}