영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There is a list of n numbers and two players who move alternately. On each move, a player removes either the first or last number from the list, and their score increases by that number. Both players try to maximize their scores.
What is the maximum possible score for the first player when both players play optimally?
Input
The first input line contains an integer n: the size of the list.
The next line has n integers x_1,x_2,…,x_n: the contents of the list.
Output
Print the maximum possible score for the first player.
Constraints
- 1 ≤ n ≤ 5000
- -10^9 ≤ x_i ≤ 10^9
예제
예제 1
4 4 5 1 3
8