have n heaps of squares. The I-th stack contains hey squares and it's stature is the number of squares in it. In one action you can take a square from the I-th stack (in case there is something like one square) and put it to the i+1-th stack. Would you be able to make the arrangement of statures rigorously expanding? Note that the number of stacks consistently remains n: stacks don't vanish when they have 0 squares.
Correct answer will be upvoted else downvoted. Computer science.
You have n heaps of squares. The I-th stack contains hey squares and it's stature is the number of squares in it. In one action you can take a square from the I-th stack (in case there is something like one square) and put it to the i+1-th stack. Would you be able to make the arrangement of statures rigorously expanding?
Note that the number of stacks consistently remains n: stacks don't vanish when they have 0 squares.
Input
First line contains a solitary integer t (1≤t≤104) — the number of experiments.
The principal line of each experiment contains a solitary integer n (1≤n≤100). The second line of each experiment contains n integers hello there (0≤hi≤109) — beginning statures of the stacks.
It's dependable that the amount of everything n doesn't surpass 104.
Output
For each experiment output YES in the event that you can make the succession of statures rigorously expanding and NO in any case.
You might print each letter regardless (for instance, YES, Yes, indeed, yEs will be generally perceived as certain reply)..
Step by step
Solved in 4 steps with 1 images
