#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<algorithm>usingnamespace std;constint N =310;constint INF =0x3f3f3f3f;int n;int a[N], s[N];int f[N][N];intmain(){
cin >> n;for(int i =1; i <= n; i++) cin >> a[i];for(int i =1; i <= n; i++) s[i]= s[i -1]+ a[i];memset(f,0x3f,sizeof f);//求最小初始化成最大for(int len =1; len <= n; len++){//区间长度for(int i =1; i + len -1<= n; i++){//起始位置int l = i, r = i + len -1;if(len ==1) f[l][r]=0;else{for(int k = l; k < r; k++){//合并的分解位置
f[l][r]=min(f[l][r], f[l][k]+ f[k +1][r]+ s[r]- s[l -1]);}}}}
cout << f[1][n]<< endl;return0;}