Correct answer will be upvoted else downvoted. Computer science. In the event that right now Pekora hops on trampoline I, the trampoline will dispatch her to situate i+Si, and Si will become equivalent to max(Si−1,1). At the end of the day, Si will diminish by 1, besides of the case Si=1, when Si will stay equivalent to 1. On the off chance that there is no trampoline in position i+Si, this ignore is. Any other way, Pekora will proceed with the pass by hopping from the trampoline at position i+Si by a similar principle as above. Pekora can't quit hopping during the pass until she arrives at the position bigger than n (in which there is no trampoline). Poor Pekora! Pekora is an underhanded hare and needs to demolish the jumping place by diminishing all Si to 1. What is the base number of passes she really wants to diminish all Si to 1? Input The main line contains a solitary integer t (1≤t≤500) — the number of experiments. The principal line of each experiment contains a solitary integer n (1≤n≤5000) — the number of trampolines. The second line of each experiment contains n integers S1,S2,… ,Sn (1≤Si≤109), where Si is the strength of the I-th trampoline. It's dependable that the amount of n over all experiments doesn't surpass 5000. Output For each experiment, output a solitary integer — the base number of passes Pekora needs to do to decrease all Si to 1.
Correct answer will be upvoted else downvoted. Computer science.
In the event that right now Pekora hops on trampoline I, the trampoline will dispatch her to situate i+Si, and Si will become equivalent to max(Si−1,1). At the end of the day, Si will diminish by 1, besides of the case Si=1, when Si will stay equivalent to 1.
On the off chance that there is no trampoline in position i+Si, this ignore is. Any other way, Pekora will proceed with the pass by hopping from the trampoline at position i+Si by a similar principle as above.
Pekora can't quit hopping during the pass until she arrives at the position bigger than n (in which there is no trampoline). Poor Pekora!
Pekora is an underhanded hare and needs to demolish the jumping place by diminishing all Si to 1. What is the base number of passes she really wants to diminish all Si to 1?
Input
The main line contains a solitary integer t (1≤t≤500) — the number of experiments.
The principal line of each experiment contains a solitary integer n (1≤n≤5000) — the number of trampolines.
The second line of each experiment contains n integers S1,S2,… ,Sn (1≤Si≤109), where Si is the strength of the I-th trampoline.
It's dependable that the amount of n over all experiments doesn't surpass 5000.
Output
For each experiment, output a solitary integer — the base number of passes Pekora needs to do to decrease all Si to 1.
Step by step
Solved in 2 steps with 1 images
