石子合并

#include <cstdio>
#include <iostream>

using namespace std;

int n;
int s[105];
int a[105];
int js[105][105];

int main(){
    cin >> n;
    memset(js, 1, sizeof(js));
    for(int i = 1; i <= n; ++i){
        cin >> s[i];
        a[i] = a[i - 1] + s[i];
        js[i][i] = 0;
    }
    for(int i = 1; i <= n - 1; ++i){
        for(int j = 1; j <= n - i; ++j){
            for(int k = j; k <= j + i - 1; ++k){
               js[j][i + j] = min(js[j][i + j], js[j][k] + js[k + 1][i + j] + a[i + j] - a[j - 1]);
            }
        }
    }
    cout << js[1][n];
}