1388. 游戏 - AcWing题库

#include <bits/stdc++.h>using namespace std;
const int N = 110;
int n , s[N];
int f[N][N][2];
int a[N];int sum(int l, int r)
{return s[r] - s[l - 1];
}int main()
{cin >> n;for(int i = 1;i <= n;i ++){cin >> a[i];s[i] = s[i - 1] + a[i];}for(int i = 1;i <= n;i ++){f[i][i][0] = a[i];f[i][i][1] = a[i];f[i][i + 1][0] = max(a[i] , a[i + 1]);f[i][i + 1][1] = max(a[i] , a[i + 1]);}for(int i = n;i >= 1;i --){for(int j = i + 1;j <= n; j ++){for(int k = 0;k <= 1;k ++){f[i][j][k] = max(f[i][j][k] , sum(i , j - 1)- f[i][j - 1][1 - k] + a[j]);f[i][j][k] = max(f[i][j][k] , sum(i + 1 , j)- f[i + 1][j][1 - k] + a[i]);}}}cout << f[1][n][0] << ' ' << sum(1 , n) - f[1][n][0] << endl;return 0;
}