AcWing 282. 石子合并
原题链接
简单
作者:
_如鲸向海
,
2022-06-25 11:30:48
,
所有人可见
,
阅读 138
C++ 代码
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 310;
int f[N][N];
int s[N];
int main(){
int number;
cin>>number;
for(int i = 1;i<=number;i++) cin>>s[i];
for(int i = 1;i<=number;i++) s[i] += s[i-1];
for(int len = 2;len<=number;len++)
for(int i = 1;i + len -1<=number;i++){
int l = i,r = i + len -1 ;
f[l][r] = 1e8;
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][number]<<endl;
return 0;
}