40pts,WA2,3,4求原因，回复有用必关

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int N2=210,N=110;
int n,dp1[N2][N],dp2[N2][N],a[N2];

int main(){
//	freopen("p1880.in","r",stdin);
	cin>>n;
	memset(dp1,0x3f,sizeof(dp1));
	memset(dp2,0,sizeof(dp2));
	for(int i=1;i<=n;i++){
		cin>>a[i];
		a[i+n]=a[i];
		dp1[n+i][1]=dp1[i][1]=0;
	}
	for(int i=1;i<=2*n;i++) a[i]+=a[i-1];
	for(int j=2;j<=n;j++){
		for(int i=1;i<=n;i++){
			for(int k=1;k<j;k++){
				dp1[i][j]=min(dp1[i][k]+dp1[i+k][j-k]+a[i+j-1]-a[i-1],dp1[i][j]);
				dp2[i][j]=max(dp2[i][k]+dp2[i+k][j-k]+a[i+j-1]-a[i-1],dp2[i][j]);
			}
		}
	}
	int ans1=dp1[1][n],ans2=dp2[1][n];
	for(int i=1;i<=n;i++){
		ans1=min(ans1,dp1[i][n]);
		ans2=max(ans2,dp2[i][n]);
	}
	cout<<ans1<<endl<<ans2<<endl;
	return 0;
}