3964. Minimum Lights to Illuminate a Road

You are given an integer array lights of length n, representing positions 0 through n - 1 on a road. For each position i: - If lights[i] = v, where v > 0, there is a working bulb at position i that illuminates every position from max(0, i - v) to min(n - 1, i + v), inclusive. - If lights[i] = 0, there is no working bulb at position i. A position is visible if it is illuminated by at least one