满江MLE求救!!!(本蒟蒻第一次全MLE)

#include <bits/stdc++.h>
using namespace std;
long long n,m[10005],dp[10005][10005] = {0},num[10005],sum[10005] = {0};
int main(){
	cin >> n;
	memset(dp,0x3f,sizeof(dp));
	for(int i = 1;i <= n;i++){
		cin >> m[i];
		sum[i] = sum[i - 1] + m[i];
		dp[i][i] = 0;
	}
	for(int len = 2;len <= n;len++){
		for(int i = 1;i <= n - len + 1;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];
	return 0;
}