CF797E Array Queries

$ a $ is an array of $ n $ positive integers, all of which are not greater than $ n $ . You have to process $ q $ queries to this array. Each query is represented by two numbers $ p $ and $ k $ . Several operations are performed in each query; each operation changes $ p $ to $ p+a_{p}+k $ . There operations are applied until $ p $ becomes greater than $ n $ . The answer to the query is the number of performed operations.

N/A

N/A

Consider first example: In first query after first operation $ p=3 $ , after second operation $ p=5 $ . In next two queries $ p $ is greater than $ n $ after the first operation.