#include <bits/stdc++.h> using namespace std; const int N = 310; int dp[N][N], len, a[N], n, sum[N]; int main(){ cin >> n; memset(dp, 0x3f, sizeof(dp)); for (int i = 1; i <= n; i++){ cin >> a[i]; sum[i] = sum[i - 1] + a[i]; dp[i][i] = 0; } for (int len = 2; len <= n; len++){ for (int i = 1; i <= n - len + 1; i++){ int j = i + len - 1; for (int k = i; k < j; k++) dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1]); } } cout << dp[1][n]; }