Max profit when taking a value skips ahead

You walk an array of positive integers from index 0. At index i you either take arr[i] and jump to index i + 1 + arr[i], or skip it and move to i + 1. Return the largest total you can collect. Solve it with DP from the right end.