代码

#include <bits/stdc++.h>
using namespace std;
int f1[205][205],f2[205][205],a[205]={0};
int main(){
    memset(f1,63,sizeof(f1));
    memset(f2,0,sizeof(f2));
    int n,ans1=99999999,ans2=0;
    cin>>n;
    for(int i=1;i<=n;i++){
    	cin>>a[i];a[i+n]=a[i];
    	f1[i][i]=f2[i][i]=0;
    	f1[i+n][i+n]=f2[i+n][i+n]=0;
	}
	for(int i=2;i<=2*n;i++) 
	    a[i]=a[i]+a[i-1];
	for(int l=1;l<=n;l++)
	    for(int i=1;i<=n*2;i++){
	    	int j=i+l-1;if(j>2*n)break;
	    	for(int k=i;k<j;k++){
	    		f1[i][j]=min(f1[i][j],f1[i][k]+f1[k+1][j]+a[j]-a[i-1]);
	    		f2[i][j]=max(f1[i][j],f1[i][k]+f1[k+1][j]+a[j]-a[i-1]);
			}
		}
	for(int i=1;i<=n;i++){
		ans1=min(ans1,f1[i][i+n-1]);
		ans2=max(ans2,f2[i][i+n-1]);
	}
	cout<<ans1<<endl<<ans2<<endl;
	return 0;
}