题目链接:点击这里
题目大意:
给一个长度为
n
n
n 序列,相同的两个
x
x
x 可以合并成
x
+
1
x+1
x+1 ,求最后最少能剩下多少个元素
题目分析:
区间
d
p
dp
dp
设
d
p
[
i
]
[
j
]
dp[i][j]
dp[i][j] 表示区间
[
i
,
j
]
[i,j]
[i,j] 最少会剩的数字个数,
a
[
i
]
[
j
]
a[i][j]
a[i][j] 表示区间
[
i
,
j
]
[i,j]
[i,j] 合并出来的数字是多少
区间
d
p
dp
dp 枚举时,如果
d
p
[
i
,
k
]
=
d
p
[
k
+
1
]
[
j
]
=
1
dp[i,k]=dp[k+1][j]=1
dp[i,k]=dp[k+1][j]=1 且
a
[
i
,
k
]
=
a
[
k
+
1
]
[
j
]
a[i,k]=a[k+1][j]
a[i,k]=a[k+1][j] 就表示
[
i
,
k
]
,
[
k
+
1
]
[
j
]
[i,k],[k+1][j]
[i,k],[k+1][j] 两个区间的最优解都是一个数字而且这两个数字还相等,可以合并,这时就把这两个区间合并即可
具体细节见代码:
//#pragma GCC optimize(2)
//#pragma GCC optimize("Ofast","inline","-ffast-math")
//#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#define ll long long
#define inf 0x3f3f3f3f
//#define int ll
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int read()
{
int res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 3e3+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
int n,m,a[maxn][maxn],dp[maxn][maxn];
char mp[maxn][maxn];
int main()
{
n = read();
for(int i = 1;i <= n;i++)
for(int j = i;j <= n;j++) dp[i][j] = j-i+1;
for(int i = 1;i <= n;i++) a[i][i] = read();
for(int l = 2;l <= n;l++)
for(int i = 1,j = l;j <= n;i++,j++)
for(int k = i;k < j;k++)
{
dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]);
if(dp[i][k]==1 && dp[k+1][j]==1 && a[i][k]==a[k+1][j])
dp[i][j] = 1,a[i][j] = a[i][k]+1;
}
cout<<dp[1][n]<<endl;
return 0;
}