[暑假集训]开训复健练习赛 G - You Are the One

#include <iostream> 
#include <cmath> 
#include <algorithm> 
#define REP(i, begin, end) for (int i = begin; i <= end; i ++) 
#define DEBUG if(1)
#define INF 5000*100+100
using namespace std; 
int dp[105][105], D[105], sum[105],NN,N; 
int main(){ 
    int t; cin>>NN; 
    REP(CASE,1,NN){ 
        int n; cin>>N; 
        sum[0] = 0; 
        REP(i,0,N){ 
            REP(j,0,N){ 
                if (j <= i) 
                    dp[i][j] = 0; 
                else 
                    dp[i][j] = INF; 
            } 
        } 
        REP(i,1,N){ 
            cin>>D[i]; 
            sum[i] = sum[i-1] + D[i]; 
        } 
        REP (len,1,N){ 
            REP (i,1,N){ 
                int j = i + len; 
                REP(k,i,j){ 
                    dp[i][j] = min(dp[i][j], 
                            dp[i+1][k]+//先排出第k个前的
                            (k-i)*D[i]+//如果第i个是第k次排出
                            dp[k+1][j]+//加上k后的
                            (k-i+1)*(sum[j]-sum[k])//k后的加一倍
                        ); 
                } 
            } 
        } 
        cout<<"Case #"<<CASE<<": "<<dp[1][N]<<endl;
    } 
    return 0; 
}

https://vjudge.net/contest/382410#problem/G