Intervalo de codificación de compresión dp
题 解
f [i] [j] = mínimo (f [i] [k] + f [k + 1] [j] + suma [i] [j])
#include<iostream>
using namespace std;
#include<cstring>
#include<algorithm>
#define ll long long
int t[1005];
ll f[1005][1005];
ll sum[1005];
int n;
int main()
{
cin>>n;
memset(f,0x1f1f1f1f,sizeof(f));
for(int i=1;i<=n;i++)
{
scanf("%d",&t[i]);
f[i][i]=0;
sum[i]=sum[i-1]+t[i];
}
for(int len=2;len<=n;len++) //len(l,r)
for(int l=1;l<=n-len+1;l++)
{
int r=l+len-1;
for(int k=l;k<=r-1;k++)
{
f[l][r]=min(f[l][r],f[l][k]+f[k+1][r]+sum[r]-sum[l-1]);
}
}
cout<<f[1][n];
return 0;
}