# O(n^2)
def can_reach_last_house(maximum_jump_lengths):
    n = len(maximum_jump_lengths)
    dp = [False]*n

    dp[0] = True
    for i in range(0, n):
        for j in range(0, i):
            if dp[j] and j + maximum_jump_lengths[j] >= i:
                dp[i] = True
                break
    return dp[n-1]