题目链接:https://cn.vjudge.net/contest/319950#problem/C
推出状态转移方程,再实现代码,区间dp的第一层循环一般都是区间长度,因为是由小区间推出大区间,第二层一般都是区间的起点。
#include<iostream>
using namespace std;
typedef long long ll;
const ll INF = 1e17;
ll n, l, r;
ll dp[105][105][105], sum[105];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
while(cin >> n >> l >> r)
{
ll tmp;
for(ll i = 1; i <= n; ++i){
cin >> tmp;
sum[i] = sum[i-1] + tmp;
}
for(ll i = 1; i <= n; ++i)
for(ll j = 1; j <= n; ++j)
for(ll k = 1; k <= n; ++k)
dp[i][j][k] = INF;
for(ll i = 1; i <= n; ++i)
for(ll j = i; j <= n; ++j)
dp[i][j][j-i+1] = 0;
//状态转移方程
for(int d=1; d<=n; d++){ //区间间隔
for(int i=1; i+d<=n; i++){ //起始位置
for(int k=l; k<=r; k++){ //分割点
for(int j=i; j<=i+d-1; j++)
dp[i][i+d][1]=min(dp[i][i+d][1],dp[i][j][1]+dp[j+1][i+d][k-1]+sum[i+d]-sum[i-1]);
}
for(int k=2; k<=d; ++k)
for(int j=i; j<=i+d-1; ++j)
dp[i][i+d][k]=min(dp[i][i+d][k],dp[i][j][k-1]+dp[j+1][i+d][1]);
}
}
if(dp[1][n][1] == INF) cout <<"0" << endl;
else cout << dp[1][n][1] << endl;
}
return 0;
}