Jump Game VI

You start at index 0 and want to reach the last index. From index i you can jump to any index in [i + 1, min(n - 1, i + k)]. Your score is the sum of nums[j] for every index j visited. Print the maximum score.

1 <= n, k <= 10^5 -10^4 <= nums[i] <= 10^4