51nod 1021 石子归并

题目链接https://www.51nod.com/Challenge/Problem.html#!#problemId=1021

这道题是一道经典的区间dp题，我们用dp[i][j]表示i到j的区间最小合并

然后地推公式dp[j][i] = min(dp[j][i],dp[j][k] + dp[k + 1][i] + sum[i] - sum[j - 1]);

代码如下

#include <bits/stdc++.h>
#define endl '\n'
typedef long long ll;
 
using namespace std;
 
const ll maxn = 2e5 + 7;
const ll mod = 1e9 + 7;

ll dp[105][105];
ll sum[105];
ll a[maxn];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    
    ll n;
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
    	cin >> a[i];
    	sum[i] = sum[i - 1] + a[i];
	}
	
	memset(dp,0x3f,sizeof(dp));
	
	for(int i = 1; i <= n; i ++)
	{
		dp[i][i] = 0;
	}	
	
	
	for(int i = 1; i <= n; i ++)
	{
		for(int j = i - 1; j >= 1; j --)
		{
			for(int k = j; k < i; k ++)
			{
				dp[j][i] = min(dp[j][i],dp[j][k] + dp[k + 1][i] + sum[i] - sum[j - 1]);
			}
		}
	}
	
	cout << dp[1][n] << endl;
	
	return 0;
}