CF1604A.Era

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

  • Select any positive integer kk (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 kk into the sequence at this position.
  • This way, the sequence aa changes, and the next operation is performed on this changed sequence.

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

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

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.

输入格式

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

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

The second line of each test case contains nn integers a1,a2,,ana_1, a_2, \ldots, a_n ( 1ai1091 \le a_i \le 10^9 ) — the elements of the sequence.

输出格式

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

输入输出样例

  • 输入#1

    4
    3
    1 3 4
    5
    1 2 5 7 4
    1
    1
    3
    69 6969 696969

    输出#1

    1
    3
    0
    696966

说明/提示

In the first test case, we have to perform at least one operation, as a2=3>2a_2=3>2 . We can perform the operation [1,3,4][1,2,3,4][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][1,2,3,5,7,4][1,2,3,4,5,7,4][1,2,3,4,5,3,7,4][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.

首页