2786. Visit Array Positions to Maximize Score

You are given a 0-indexed integer array nums and a positive integer x. You are initially at position 0 in the array and you can visit other positions according to the following rules: - If you are currently in position i, then you can move to any position j such that i < j. - For each position i that you visit, you get a score of nums[i]. - If you move from a position i to a position j and the