1
class Solution:
2
    def mostPoints(self, q: List[List[int]]) -> int:
3
        @cache
4
        def dfs(i: int) -> int:
5
            return 0 if i >= len(q) else max(dfs(i + 1), q[i][0] + dfs(i + 1 + q[i][1]))
6

7
        return dfs(0)