Codeforces - 1486A - A. Shifting Stacks

最新推荐文章于 2024-08-25 06:11:42 发布

謹謹

最新推荐文章于 2024-08-25 06:11:42 发布

阅读量163

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/weixin_62765166/article/details/125739295

版权

博客介绍了如何解决Codeforces的1486A问题——通过移动积木使栈的高度序列变得严格递增。讨论了初始的贪心思路并提出正确解法，即比较每个栈的前缀和与理想递增数列的前缀和。

摘要由CSDN通过智能技术生成

A. Shifting Stacks

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output

You have n stacks of blocks. The i-th stack contains hi 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.

Input
First line contains a single integer t (1≤t≤104) — the number of test cases.

The first line of each test case contains a single integer n (1≤n≤100). The second line of each test case contains n integers hi (0≤hi≤109) — starting heights of the stacks.

It’s guaranteed that the sum of all n does not exceed 104.

Output
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).

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

YES
YES
YES
NO
NO
YES
Note
In the first test case there is no need to make any moves, the sequence of heights is already increasing.

In the second test case we need to move one block from the first stack to the second. Then the heights become 0 1.

In the third test case we could move one block from the first stack to the second and then from the second to the third, which would make the heights 3 4 5.

In the fourth test case we can’t make a move, but the sequence is not increasing, so the answer is NO.

In the fifth test case we can only make one move (from the second to the third stack), which would make the heights 0 0 1. Both 0 1 0 and 0 0 1 are not increasing sequences, so the answer is NO.

原题链接https://codeforces.com/probl