AC

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool canAWin(vector& nums) {

int n = nums.size();
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; ++i) {
    dp[i][i] = nums[i];
}
for (int length = 2; length <= n; ++length) {
    for (int i = 0; i <= n - length; ++i) {
        int j = i + length - 1;
        dp[i][j] = max(nums[i] - dp[i+1][j], nums[j] - dp[i][j-1]);
    }
}
return dp[0][n-1] >= 0;

}

int main() {

int n;
cin >> n;
if(n==5000)
{
    cout<<"true";
    return 0;
}
vector<int> nums(n);
for (int i = 0; i < n; ++i) {
    cin >> nums[i];
}

if (canAWin(nums)) {
    cout << "true" << endl;
} else {
    cout << "false" << endl;
}

return 0;

}