| Submit | All submissions | Best solutions | Back to list |
EIUCOINGAME2 - STRATEGY FOR A GAME |
Consider a row of N coins of values V1 . . . Vn. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first.
Note: The opponent is as clever as the user.
Input
- The first line contains an integer N - the number of coins.
- In the next line contains N numbers which are coin values.
Output
- Print the maximum amount of money.
|
Input |
Output |
|
4 5 3 7 10 |
15
|
|
4 8 15 3 7 |
22 |
| Added by: | Ha Minh Ngoc |
| Date: | 2024-06-25 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | CSHARP C++ 4.3.2 CPP CPP14 CPP14-CLANG FSHARP GO JAVA JS-MONKEY NODEJS PHP PYTHON PYPY PYPY3 PYTHON3 RUBY SQLITE SWIFT VB.NET |
RSS