40求助

#include<bits/stdc++.h>
#define N 1001
using namespace std;
int a[N],sum[N],dp[N][N],f[N][N];
int main(){
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n*2;i++){
        scanf("%d",&a[i]);
        a[i+n]=a[i];
        sum[i]=sum[i-1]+a[i];
    }
    for(int l=2;l<=n;l++){
        for(int i=1,j=l;i+l-1<=n<<1;i++,j=i+l-1){
            dp[i][j]=0x3f3f3f3f;
            f[i][j]=0;
            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]);
                f[i][j]=max(f[i][j],f[i][k]+f[k+1][j]+sum[j]-sum[i-1]);
            }
        }
    }
    int ans=0x3f3f3f3f,ansn=0;
    for(int i=1;i<=n;i++)
        ansn=max(ans,f[i][i+n-1]),ans=min(ans,dp[i][i+n-1]);
    printf("%d\n%d",ans,ansn);
    return 0;
}