B"You are given an array a_1, a_2, ... , a_n , consisting of n integers. You goal is to make is strictly increasing. To achieve that, you perform each of the following operations exactly once: Note that you are not allowed to rearrange the elements of the array. For the resulting array a' , a'_1 < a'_2 < ... < a'_{n-1} should hold. Determine if it's possible to achieve that. The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 2 <= n <= 2 cdot 10^5 ) -- the number of elements of the array. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^6 ). The sum of n over all testcases doesn't exceed 2 cdot 10^5 . For each testcase, print YES if it's possible to remove one element and add 1 to some elements (possibly, none or all), so that the array becomes strictly increasing. Otherwise, print NO. In the first testcase, you can remove the third element and add 1 to the second and the last element. a' will become [4, 5, 6] , which is strictly increasing. In the second testcase, there is no way to perform the operations, so that the result is strictly increasing. In the third testcase, you can remove either of the elements. In the fourth testcase, you are already given a strictly increasing array, but you still have to remove an element. The result a' can be [1, 3] , for example. "...