Codeforces Round 752 (Div. 2)
A
Era
Codeforces
800
原题
←B →
翻译中…

Shohag has an integer sequence $a_1, a_2, \ldots, a_n$. He can perform the following operation any number of times (possibly, zero):

翻译中…
  • Select any positive integer $k$ (it can be different in different operations).
  • Choose any position in the sequence (possibly the beginning or end of the sequence, or in between any two elements) and insert $k$ into the sequence at this position.
  • This way, the sequence $a$ changes, and the next operation is performed on this changed sequence.
翻译中…

For example, if $a=[3,3,4]$ and he selects $k = 2$, then after the operation he can obtain one of the sequences $[\underline{2},3,3,4]$, $[3,\underline{2},3,4]$, $[3,3,\underline{2},4]$, or $[3,3,4,\underline{2}]$.

翻译中…

Shohag wants this sequence to satisfy the following condition: for each $1 \le i \le |a|$, $a_i \le i$. Here, $|a|$ denotes the size of $a$.

翻译中…

Help him to find the minimum number of operations that he has to perform to achieve this goal. We can show that under the constraints of the problem it's always possible to achieve this goal in a finite number of operations.

翻译中…

Input

翻译中…

The first line contains a single integer $t$ ($1 \le t \le 200$)  — the number of test cases.

翻译中…

The first line of each test case contains a single integer $n$ ($1 \le n \le 100$) — the initial length of the sequence.

翻译中…

The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$) — the elements of the sequence.

翻译中…

Output

翻译中…

For each test case, print a single integer  — the minimum number of operations needed to perform to achieve the goal mentioned in the statement.

翻译中…

Note

翻译中…

In the first test case, we have to perform at least one operation, as $a_2=3 \gt 2$. We can perform the operation $[1, 3, 4] \rightarrow [1, \underline{2}, 3, 4]$ (the newly inserted element is underlined), now the condition is satisfied.

翻译中…

In the second test case, Shohag can perform the following operations:

翻译中…

$[1, 2, 5, 7, 4] \rightarrow [1, 2, \underline{3}, 5, 7, 4] \rightarrow [1, 2, 3, \underline{4}, 5, 7, 4] \rightarrow [1, 2, 3, 4, 5, \underline{3}, 7, 4]$.

翻译中…

In the third test case, the sequence already satisfies the condition.

翻译中…

样例

Input #1
4
3
1 3 4
5
1 2 5 7 4
1
1
3
69 6969 696969
Output #1
1
3
0
696966
InputCopy OutputCopy
题目信息
题号
1604A
时间限制
1 s
内存限制
256 MB
标签
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。