- Time limit: 1.00 s
- Memory limit: 512 MB
What is the maximum possible score for the first player when both players play optimally?
The first input line contains an integer $n$: the size of the list.
The next line has $n$ integers $x_1,x_2,\ldots,x_n$: the contents of the list.
Print the maximum possible score for the first player.
- $1 \le n \le 5000$
- $-10^9 \le x_i \le 10^9$
4 5 1 3