1385C.md (3204B)
1 Source: https://codeforces.com/problemset/problem/1385/C 2 3 C. Make It Good 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 You are given an array $a$ consisting of $n$ integers. You have to find the length of the smallest (shortest) prefix of elements you need to erase from $a$ to make it a good array. Recall that the prefix of the array $a=[a_1, a_2, \dots, a_n]$ is a subarray consisting several first elements: the prefix of the array $a$ of length $k$ is the array $[a_1, a_2, \dots, a_k]$ ($0 \le k \le n$). 22 23 The array $b$ of length $m$ is called good, if you can obtain a non-decreasing array $c$ ($c_1 \le c_2 \le \dots \le c_{m}$) from it, repeating the following operation $m$ times (initially, $c$ is empty): 24 25 * select either the first or the last element of $b$, remove it from $b$, and append it to the end of the array $c$. 26 27 For example, if we do $4$ operations: take $b_1$, then $b_{m}$, then $b_{m-1}$ and at last $b_2$, then $b$ becomes $[b_3, b_4, \dots, b_{m-3}]$ and $c =[b_1, b_{m}, b_{m-1}, b_2]$. 28 29 Consider the following example: $b = [1, 2, 3, 4, 4, 2, 1]$. This array is good because we can obtain non-decreasing array $c$ from it by the following sequence of operations: 30 31 1. take the first element of $b$, so $b = [2, 3, 4, 4, 2, 1]$, $c = [1]$; 32 2. take the last element of $b$, so $b = [2, 3, 4, 4, 2]$, $c = [1, 1]$; 33 3. take the last element of $b$, so $b = [2, 3, 4, 4]$, $c = [1, 1, 2]$; 34 4. take the first element of $b$, so $b = [3, 4, 4]$, $c = [1, 1, 2, 2]$; 35 5. take the first element of $b$, so $b = [4, 4]$, $c = [1, 1, 2, 2, 3]$; 36 6. take the last element of $b$, so $b = [4]$, $c = [1, 1, 2, 2, 3, 4]$; 37 7. take the only element of $b$, so $b = []$, $c = [1, 1, 2, 2, 3, 4, 4]$ — $c$ is non-decreasing. 38 39 Note that the array consisting of one element is good. 40 41 Print the length of the shortest prefix of $a$ to delete (erase), to make $a$ to be a good array. Note that the required length can be $0$. 42 43 You have to answer $t$ independent test cases. 44 45 Input 46 47 The first line of the input contains one integer $t$ ($1 \le t \le 2 \cdot 10^4$) — the number of test cases. Then $t$ test cases follow. 48 49 The first line of the test case contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of $a$. The second line of the test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 2 \cdot 10^5$), where $a_i$ is the $i$-th element of $a$. 50 51 It is guaranteed that the sum of $n$ does not exceed $2 \cdot 10^5$ ($\sum n \le 2 \cdot 10^5$). 52 53 Output 54 55 For each test case, print the answer: the length of the shortest prefix of elements you need to erase from $a$ to make it a good array. 56 57 Example 58 59 Input 60 61 ``` 62 5 63 4 64 1 2 3 4 65 7 66 4 3 3 8 4 5 2 67 3 68 1 1 1 69 7 70 1 3 1 4 5 3 2 71 5 72 5 4 3 2 3 73 ``` 74 75 Output 76 77 ``` 78 0 79 4 80 0 81 2 82 3 83 ``` 84 85 Note 86 87 In the first test case of the example, the array $a$ is already good, so we don't need to erase any prefix. 88 89 In the second test case of the example, the initial array $a$ is not good. Let's erase first $4$ elements of $a$, the result is $[4, 5, 2]$. The resulting array is good. You can prove that if you erase fewer number of first elements, the result will not be good.