282. 石子合并

#include<algorithm>
#include<iostream>
using namespace std;
const int N = 303;
int f[N][N];
int s[N];
int main()
{int n;cin>>n;for (int i=1;i<=n;i++) cin>>s[i],s[i]+=s[i-1];for (int len = 2;len<=n;len++)//len长度{for (int i=1;i+len-1<=n;i++)//左端点{int j = i+len-1;//右端点f[i][j] = 1e8;for (int k = i;k<j;k++){f[i][j] = min(f[i][j],f[i][k]+f[k+1][j]+s[j]-s[i-1]);}}}cout<<f[1][n]<<endl;return  0;
}