You are given an array $$$a$$$ of length $$$n$$$, consisting of positive integers.
You can perform the following operation on this array any number of times (possibly zero):
Note that you can choose any integer as $$$x$$$, it doesn't have to be positive.
You have to calculate the minimum number of operations to make the array $$$a$$$ sorted in strictly ascending order (i. e. the condition $$$a_1 < a_2 < \dots < a_n$$$ must be satisfied).
The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.
The first line of each test case contains one integer $$$n$$$ ($$$1 \le n \le 2 \cdot 10^5$$$) — the length of the array $$$a$$$.
The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the array $$$a$$$.
Additional constraint on the input: the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
For each test case, print one integer — the minimum number of operations required to make $$$a$$$ sorted in strictly ascending order.
351 1 2 2 265 4 3 2 5 131 2 3
3 2 0
In the first test case, we can perform the operations as follows:
In the second test case, we can perform one operation as follows:
In the third test case, the array $$$a$$$ is already sorted.
Name |
---|