- 题解
石子合并
- @ 2026-8-9 11:33:43
```cpp
#include<bits/stdc++.h>
using namespace std;
const int N = 305;
int f[N][N], sum[N], a[N];
int n;
int main(){
cin >> n;
memset(f, 0x3f, sizeof f);
for(int i = 1; i <= n; i++)
cin >> a[i], f[i][i] = 0, sum[i] = sum[i-1] + a[i];
for(int len = 2; len <= n; len++){
for(int l = 1; l + len - 1 <= n; l++){
int r = l + len - 1;
for(int k = l; k < r; k++){
f[l][r] = min(f[l][k]+f[k+1][r]+sum[r]-sum[l- 1], f[l][r]);
}
}
}
cout << f[1][n];
return 0;
}
0 条评论
目前还没有评论...