区间DP

for(int len = 1;len<=n;len++){//枚举长度
        for(int j = 1;j+len<=n+1;j++){//枚举起点，ends<=n
            int ends = j+len - 1;
            for(int i = j;i<ends;i++){//枚举分割点，更新小区间最优解
                dp[j][ends] = min(dp[j][ends],dp[j][i]+dp[i+1][ends]+something);
            }
        }
}

区间DP模板

简单例题：

下面是代码：

#include<bits/stdc++.h>
using namespace std;
int dp[105][105],sum[105];
int main(){
	int n;
	int data[105];
	while(~scanf("%d",&n)){
		memset(sum,0,sizeof(sum));
		memset(dp,0x3f3f3f,sizeof(dp));
		for(int i = 1;i <= n;i++){
			scanf("%d",&data[i]);
			sum[i] = sum[i-1] + data[i];
			dp[i][i] = 0;
		}
		for(int len = 1;len <= n;len++){//枚举长度 
			for(int j = 1;j+len <= n+1;j++){//枚举起点
				int ends = j + len - 1;
				for(int i = j;i < ends;i++){
					dp[j][ends] = min(dp[j][ends],dp[j][i] + dp[i+1][ends] + sum[ends] - sum[j-1]);//状态转移方程
				} 
			}
		}
		printf("%d\n",dp[1][n]);
	}
	return 0;
}

对于Monkey Party这道题https://vjudge.net/contest/314655#problem/A

要先将环线段话，例如将 1 2 3 4 5转换为1 2 3 4 5 4 3 2 1

区间DP后还要用四边形不等式优化优化（https://blog.csdn.net/noiau/article/details/72514812）

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define INF 0x3f3f3f3f3f
 
using namespace std;
 
int n;
long long dp[2005][2005];
long long sum[2005][2005];
int s[2005][2005];//四边形优化要用到的数组
int a[2005];
 
int main()
{
    while(scanf("%d",&n)!=EOF){
        memset(dp,INF,sizeof(dp));
        long long minnum=INF;
        for(int i=0;i<2004;i++){
            dp[i][i]=0;
            s[i][i]=i;//四边形优化要用到的数组
        }//初始化dp和s 
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        if(n==1){
            cout<<0<<endl;
            continue;
        }
        for(int i=n+1;i<2*n;i++){
            a[i]=a[i-n];
        }//环线段化 
        for(int i=1;i<2*n;i++){
            for(int j=i;j<i+n&&j<2*n;j++){
                sum[i][j]=sum[i][j-1]+a[j];
            }
        }
        for(int len=2;len<=n;len++){//枚举长度 
            for(int i=1;i<=n;i++){
                int j=i+len-1;
                for(int k=s[i][j-1];k<=s[i+1][j];k++){
                    if(dp[i][k]+dp[k+1][j]+sum[i][j]<dp[i][j]){
                        dp[i][j]=dp[i][k]+dp[k+1][j]+sum[i][j];
                        //cout<<dp[i][j]<<' '<<dp[i][k]<<' '<<dp[k+1][j]<<' '<<i<<' '<<j<<' '<<k<<endl;
                        s[i][j]=k;
                    }
                    if(len==n){
                        minnum=min(minnum,dp[i][j]);
                    }
                }
            }
        }
        cout<<minnum<<endl;
    }
    return 0;
}