Please explain the algorithm in words.

Due to the pandemic, You decide to stay at home and play a new board game alone. The game consists an array a of n positive integers and a chessman. To begin with, you should put your character in an arbitrary position. In each steps, you gain di points, then move your chessman at least di positions to the right (that is, i' >=i+ai). The game ends when your chessman moves out of the array. Design an algorithm that cost at most O(n) time to find the maximum points you can get. Explain your algorithm and analyze its complexity. Due to the pandemic, You decide to stay at home and play a new board game alone. The game consists an array a of n positive integers and a chessman. To begin with, you should put your character in an arbitrary position. In each steps, you gain di points, then move your chessman at least di positions to the right (that is, i' >=i+ai). The game ends when your chessman moves out of the array. Design an algorithm that cost at most O(n) time to find the maximum points you can get. Explain your algorithm and analyze its complexity