Hard problem :(

Правка en3, от Jarjit_sigh, 2021-04-22 15:54:46

I have faced this problem in my unofficial national team selection test and i have been trying to solve it for days to no avail... Hope someone could help me :(

Given an integer array of length n (n <= 100000). Alberto and Brendaly play a game on it. On each turn the player picks a number from one of the 2 ends of the sequence. Alberto goes first. Both players wants to maximize their total score by the end of the game. If they both play optimally, whats the total score Alberto gets? all elements in array are not larger than 1e9.

Thank you!

Теги games, algebra, dp, hard

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Jarjit_sigh 2021-04-22 15:54:46 48
en2 Английский Jarjit_sigh 2021-04-22 11:09:48 77
en1 Английский Jarjit_sigh 2021-04-22 11:07:50 470 Initial revision (published)