解:
DP题,
设sum[i][j]表示第i个数到第j个数的和;
设f[i][j]表示第i个数到第j个数的最大和;
方程:f[i][j] = sum[i][j] - min(f[i+1][j](取左边),f[i][j-1](取右边));
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
int N;
int a[205],dp[205][205],sum[205];
cin>>N;
memset(sum,0,sizeof(sum));
for(int i=1;i<=N;i++){
cin>>a[i];
sum[i]=sum[i-1]+a[i];
dp[i][i]=a[i];
}
for(int i=N;i>0;i--){
for(int j=i+1;j<=N;j++){
dp[i][j]=sum[j]-sum[i-1]-min(dp[i+1][j],dp[i][j-1]);
}
}
cout<<dp[1][N]<<" "<<sum[N]-dp[1][N]<<endl;
return 0;
}