题目链接:https://www.acwing.com/problem/content/284/
思路:
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
]
[
k
]
+
f
[
k
+
1
]
[
j
]
)
k
∈
(
i
,
j
−
1
)
f[i][j]=min(f[i][k] + f[k+1][j] ) k\in(i,j-1)
f[i][j]=min(f[i][k]+f[k+1][j])k∈(i,j−1)
/*
区间DP:石子合并
*/
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e3+5;
int f[maxn][maxn];
int s[maxn];
int main(){
int n; scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&s[i]);
for(int i=1;i<=n;i++) s[i]+=s[i-1];
for(int len=2;len<=n;len++){ //先枚举的长度
for(int i=1;i+len-1<=n;i++){ //后枚举的起点
int l=i,r=i+len-1; //这样枚举符合dp从小规模到大的规模的过程
f[l][r]=1e9;
for(int k=l;k<r;k++){
f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]+s[r]-s[l-1]);
}
}
}
printf("%d\n",f[1][n]);
return 0;
}