2017icpc北京 Pangu and Stones（区间DP初学）

dp[i][j][k]表示区间 i 到 j 之间的数，合并为 k 堆的最小花费
当k==1 dp[i][j][1]=min(dp[i][j][1],dp[i][k][v-1]+dp[k+1][j][1]+sum[j]-sum[i-1]);
k>1 dp[i][j][v]=min(dp[i][j][v],dp[i][k][v-1]+dp[k+1][j][1]);
其中v：l<=v<=r

#include <bits/stdc++.h>
#define eps 1e-14
#define pi acos(-1)
#define ll long long
#define RD T*(rand()*2-RAND_MAX)
#define Drand (long double)rand()/RAND_MAX
#define LINF 0x7f7f7f7f7f7f7f7f
#define INF 0x3f3f3f3f
using namespace std;
const int maxn=300;
const long long mod=1e18;
ll MOD(ll a,ll m){return a>m?a%m+m:a;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

ll a[105];
ll dp[105][105][105],sum[105];

int main()
{
//    freopen("in.txt","r",stdin);
	int n,l,r;
    while(~scanf("%d%d%d",&n,&l,&r)){
        memset(dp,INF,sizeof dp);
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);
            sum[i]=sum[i-1]+a[i];
        }
        for(int i=1;i<=n;i++){
            dp[i][i][1]=0;
        }
        for(int len=2;len<=n;len++){
            for(int i=1;i<=n;i++){//start
                int j=i+len-1;//end
                if(j>n)break;
                for(int k=i;k<j;k++){//fen ge
                    for(int v=l;v<=r;v++){//dui shu == 1
                        dp[i][j][1]=min(dp[i][j][1],dp[i][k][v-1]+dp[k+1][j][1]+sum[j]-sum[i-1]);
                    }
                    for(int v=2;v<=len;v++){//dui shu > 1
                        dp[i][j][v]=min(dp[i][j][v],dp[i][k][v-1]+dp[k+1][j][1]);

                    }
                }
            }
        }
        printf("%lld\n",dp[1][n][1]==dp[0][0][0]?0:dp[1][n][1]);
    }
    return 0;
}