IOI '96 P1 - A Game - DMOJ: Modern Online Judge

IOI '96 P1 - A Game

Points: 10

Time limit: 1.0s

Memory limit: 32M

Problem types

IOI '96 - Veszprém, Hungary

Consider the following two-player game played with a sequence of $N$ ~N~ positive integers $(2 \le N \le 100)$ ~(2 \le N \le 100)~ laid onto a game board. Player $1$ ~1~ starts the game. The players move alternately by selecting a number from either the left or the right end of the sequence. That number is then deleted from the board, and its value is added to the score of the player who selected it. A player wins if his sum is greater than his opponents.

Write a program that implements the optimal strategy. The optimal strategy yields maximum points when playing against the "best possible" opponent. Your program must further implement an optimal strategy for player $2$ ~2~.

Input Specification

Line $1$ ~1~ will contain the integer $N$ ~N~, the size of the board. The following line(s) will contain $N$ ~N~ integers between $1$ ~1~ and $200$ ~200~ inclusive that are the contents of the game board, from left to right.

Output Specification

Two space-separated integers on a line: the score of player $1$ ~1~ followed by the score of player $2$ ~2~.

Sample Input

6
4 7 2 9 5 2

Sample Output

18 11

Comments

-1

AndyZhang68 commented on Aug. 30, 2024, 9:58 p.m.

Note that it seems that the board is not guaranteed to be inputted on one line and may be a few lines long