由于策略是一定的,并且注意到每个数字都是不同的因此只需模拟即可。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI (M_PI)
#define INF (0x3f3f3f3f)
#define MOD (1000000007)
#define EPS (1e-12)
#define MAX (1000000)
#define LEN (MAX+5)
int main()
{
int n,a[1005];
cin >> n;
for(int i = 1;i <= n;++i){
scanf("%d",&a[i]);
}
int s1,s2;
s1 = s2 = 0;
int l = 1,r = n;
bool f = false;
while(l <= r){
if(a[l] > a[r]){
if(!f)s1 += a[l];
else s2 += a[l];
l++;
}
else{
if(!f)s1 += a[r];
else s2 += a[r];
r--;
}
f ^= 1;
}
cout << s1 << " " << s2 << endl;
return 0;
}