蒟蒻40求助

#include<iostream>
#include<cstring>
using namespace std;
const int N=310;
int n,sum[N],f[N][N],fx[N][N];
int main(){
	cin>>n;
	memset(f,0x3f,sizeof(f));
	for(int i=1;i<=n;i++){
		cin>>sum[i];
		sum[i+n]=sum[i];
	}
	for(int i=1;i<=2*n;i++){
		sum[i]+=sum[i-1];
//		cout<<sum[i]<<" "; 
		f[i][i]=0;
		fx[i][i]=0;
	}
	for(int p=1;p<n;p++){
		for(int i=1,j=i+p;(j<2*n)&&(i<2*n);i++,j=i+p){
			for(int k=i;k<j;k++){
				f[i][j]=min(f[i][j],f[i][k]+f[k+1][j]+sum[j]-sum[i-1]);
				fx[i][j]=max(fx[i][j],fx[i][k]+f[k+1][j]+sum[j]-sum[i-1]);
			}
		}
	}
	int minn=999999999,mx=-1;
	for(int i=1;i<=n;i++){
		minn=min(minn,f[i][i+n-1]);
		mx=max(mx,fx[i][i+n-1]);
//		cout<<f[i][i+n-1]<<" ";
	}
	cout<<minn<<endl<<mx;
}