P1775 石子合并（弱化版）

#include <bits/stdc++.h>
using namespace std;
int n;
int sum[310];
int dp[310][310];




int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> sum[i];
		sum[i] += sum[i - 1];
	}

	memset(dp, 0x7f, sizeof(dp));
	for (int i = 1; i <= n; i++) {
		dp[i][i] = 0;
	}


	for (int len = 1; len <= n; len++) {
		for (int i = 1; i <= n && i + len - 1 <= n; i++) {
			int j = i + len - 1;
			for (int k = i; k < j; k++) {
				dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] + sum[j] - sum[i - 1]);
			}

		}
	}

	cout << dp[1][n];


}