Score : $600$ points
There is an infinitely large pond, which we consider as a number line. In this pond, there are $N$ lotuses floating at coordinates $0$, $1$, $2$, ..., $N-2$ and $N-1$. On the lotus at coordinate $i$, an integer $s_i$ is written.
You are standing on the lotus at coordinate $0$. You will play a game that proceeds as follows:
You want to end the game with as high a score as possible. What is the score obtained by the optimal choice of $A$ and $B$?
Input is given from Standard Input in the following format:
$N$ $s_0$ $s_1$ $......$ $s_{N-1}$
Print the score obtained by the optimal choice of $A$ and $B$.
5 0 2 5 1 0
3
If you choose $A = 3$ and $B = 2$, the game proceeds as follows:
There is no way to end the game with a score of $4$ or higher, so the answer is $3$. Note that you cannot land the lotus at coordinate $2$ without drowning later.
6 0 10 -7 -4 -13 0
0
The optimal strategy here is to land the final lotus immediately by choosing $A = 5$ (the value of $B$ does not matter).
11 0 -4 0 -99 31 14 -15 -39 43 18 0
59