A14137 | $Shifting Stacks$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You have $n$ stacks of blocks. The $i$ -th stack contains $h_i$ blocks and it's height is the number of blocks in it. In one move you can take a block from the $i$ -th stack (if there is at least one block) and put it to the $i + 1$ -th stack. Can you make the sequence of heights strictly increasing? Note that the number of stacks always remains $n$ : stacks don't disappear when they have $0$ blocks.

First line contains a single integer $t$ $(1 \leq t \leq 10^4)$ — the number of test cases. The first line of each test case contains a single integer $n$ $(1 \leq n \leq 100)$ . The second line of each test case contains $n$ integers $h_i$ $(0 \leq h_i \leq 10^9)$ — starting heights of the stacks. It's guaranteed that the sum of all $n$ does not exceed $10^4$ .

For each test case output YES if you can make the sequence of heights strictly increasing and NO otherwise. You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answer).

输入 #1

6
2
1 2
2
1 0
3
4 4 4
2
0 0
3
0 1 0
4
1000000000 1000000000 1000000000 1000000000

输出 #1

YES
YES
YES
NO
NO
YES

C++ 编辑器

输入

输出