【区间dp】AcWing282.石子合并

AcWing282.石子合并

题解

#include <iostream>

using namespace std;

const int N = 310;

int n, f[N][N], nums[N], s[N];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> nums[i], s[i] = s[i-1] + nums[i];
    for(int len = 2; len <= n; ++len)
    {
        for(int i = 1; i <= n; ++i)
        {
            int j = i + len -1;
            if(j > n) break;
            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;
}