目录:
题目:
分析:
一道区间dp的版子题,用上前缀和,就基本破题了
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#define LL long long
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int a[301],sum[301];
int f[301][301];
int min(int x,int y)
{
return x<y? x:y;
}
int main()
{
int n=read();
memset(f,0x3f,sizeof(f));
for(int i=1;i<=n;i++) f[i][i]=0,a[i]=read(),sum[i]=sum[i-1]+a[i];
for(int cd=2;cd<=n;cd++)
for(int l=1;l<=n-cd+1;l++)
{
int r=l+cd-1;
for(int k=l;k<r;k++)
f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]);
f[l][r]+=(sum[r]-sum[l-1]);
}
printf("%d",f[1][n]);
return 0;
}