Maximize the Minimum Game Score
You are given an array points of size n and an integer m. There is another array gameScore of size n, where gameScore[i] represents the score achieved at the i^th game. Initially, gameScore[i] == 0 for all i.
You start at index -1, which is outside the array before the first position at index 0. You can make at most m moves. In each move, you can either:
- Increase the index by
1and addpoints[i]togameScore[i]. - Decrease the index by
1and addpoints[i]togameScore[i].
Note that the index must always remain within the bounds of the array after the first move.
Return the maximum possible minimum value in gameScore after at most m moves.
Example 1
Input
points = [2,4], m = 3Output
4The minimum value in
gameScore is 4, and this is the maximum possible minimum among all configurations.Example 2
Input
points = [1,2,3], m = 5Output
2The minimum value in
gameScore is 2, and this is the maximum possible minimum among all configurations.Constraints
- 2 <= n == points.length <= 5 * 10^4
- 1 <= points[i] <= 10^6
- 1 <= m <= 10^9