区间dp满江红求救！！！

#include <bits/stdc++.h>
using namespace std;
int n,m[1005],dpo[1005][1005] = {0},dpt[1005][1005],sum[1005] = {0},maxn = 0,minn = 2147483647;
int main(){
	cin >> n;
	memset(dpo,0x3f,sizeof(dpo));
	memset(dpt,0,sizeof(dpt));
	for(int i = 1;i <= n;i++){
		cin >> m[i];
		m[i + n] = m[i];
	}
	for(int i = 1;i < n * 2;i++){
		sum[i] = sum[i - 1] + m[i];
		dpo[i][i] = dpt[i][i] = 0;
	}
	for(int len = 2;len <= n;len++){
		for(int i = 1;len + i - 1 < 2 * n;i++){
			int j = len + i - 1;
			for(int k = i;k < j;k++){
				dpt[i][j] = max(dpt[i][j],dpt[i][k] + dpt[k + 1][j] + sum[j] - sum[i - 1]);
				dpo[j][j] = min(dpo[j][j],dpo[j][k] + dpo[k + 1][j] + sum[j] - sum[j - 1]);
			}
		}
	}
	for(int i = 1;i <= n;i++){
		maxn = max(maxn,dpt[i][i + n - 1]);
		minn = min(minn,dpo[i][i + n - 1]);
	}
	cout << minn << endl << maxn;
	return 0;
}