CF1340A.Nastya and Strange Generator

Denis was very sad after Nastya rejected him. So he decided to walk through the gateways to have some fun. And luck smiled at him! When he entered the first courtyard, he met a strange man who was selling something.

Denis bought a mysterious item and it was... Random permutation generator! Denis could not believed his luck.

When he arrived home, he began to study how his generator works and learned the algorithm. The process of generating a permutation consists of $n$ steps. At the $i$-th step, a place is chosen for the number $i$ $(1 \leq i \leq n)$. The position for the number $i$ is defined as follows:

• For all $j$ from $1$ to $n$, we calculate $r_j$ — the minimum index such that $j \leq r_j \leq n$, and the position $r_j$ is not yet occupied in the permutation. If there are no such positions, then we assume that the value of $r_j$ is not defined.
• For all $t$ from $1$ to $n$, we calculate $count_t$ — the number of positions $1 \leq j \leq n$ such that $r_j$ is defined and $r_j = t$.
• Consider the positions that are still not occupied by permutation and among those we consider the positions for which the value in the $count$ array is maximum.
• The generator selects one of these positions for the number $i$. The generator can choose any position.

Let's have a look at the operation of the algorithm in the following example:

Let $n = 5$ and the algorithm has already arranged the numbers $1, 2, 3$ in the permutation. Consider how the generator will choose a position for the number $4$:

• The values of $r$ will be $r = [3, 3, 3, 4, \times]$, where $\times$ means an indefinite value.
• Then the $count$ values will be $count = [0, 0, 3, 1, 0]$.
• There are only two unoccupied positions in the permutation: $3$ and $4$. The value in the $count$ array for position $3$ is $3$, for position $4$ it is $1$.
• The maximum value is reached only for position $3$, so the algorithm will uniquely select this position for number $4$.

Satisfied with his purchase, Denis went home. For several days without a break, he generated permutations. He believes that he can come up with random permutations no worse than a generator. After that, he wrote out the first permutation that came to mind $p_1, p_2, \ldots, p_n$ and decided to find out if it could be obtained as a result of the generator.

Unfortunately, this task was too difficult for him, and he asked you for help. It is necessary to define whether the written permutation could be obtained using the described algorithm if the generator always selects the position Denis needs.

纳斯塔娅拒绝了德尼斯后，他非常伤心。于是他决定穿过一道道门廊散散心。幸运之神眷顾了他！当他进入第一个庭院时，遇到了一位奇怪的男子，正在兜售某种东西。

德尼斯买下了一件神秘物品，结果竟是……一个随机排列生成器！德尼斯简直不敢相信自己的好运。

回到家后，他开始研究这个生成器的工作原理，并弄清了其算法。生成一个排列的过程共包含 $n$ 步。在第 $i$ 步（$1 \leq i \leq n$），需为数字 $i$ 选定一个位置。数字 $i$ 的位置按如下方式确定：

• 对每个 $j$（从 $1$ 到 $n$），计算 $r_j$ —— 满足 $j \leq r_j \leq n$ 且位置 $r_j$ 在当前排列中尚未被占据的最小下标；若不存在这样的位置，则认为 $r_j$ 未定义。
• 对每个 $t$（从 $1$ 到 $n$），计算 $count_t$ —— 满足 $1 \leq j \leq n$、$r_j$ 有定义且 $r_j = t$ 的 $j$ 的个数。
• 考察当前排列中尚未被占据的位置，在这些位置中，再筛选出在 $count$ 数组中对应值最大的位置。
• 生成器将从上述筛选出的位置中任选一个，作为数字 $i$ 的位置（即生成器可任意选择）。

我们通过以下示例观察该算法的运行过程：

设 $n = 5$，且算法已将数字 $1, 2, 3$ 安排进排列中。现在考察生成器如何为数字 $4$ 选择位置：

• $r$ 的取值为 $r = [3, 3, 3, 4, \times]$，其中 $\times$ 表示未定义。
• 接着 $count$ 的取值为 $count = [0, 0, 3, 1, 0]$。
• 当前排列中仅有两个未被占据的位置：$3$ 和 $4$。位置 $3$ 在 $count$ 数组中的值为 $3$，位置 $4$ 对应的值为 $1$。
• 最大值仅在位置 $3$ 处取得，因此算法将唯一地选择该位置放置数字 $4$。

德尼斯对这次购物十分满意，便回家去了。此后数日，他马不停蹄地生成各种排列。他自信自己构思随机排列的能力不逊于该生成器。接着，他写下脑海中浮现的第一个排列 $p_1, p_2, \ldots, p_n$，并想弄清楚：该排列是否可能由该生成器产生？

不幸的是，这个问题对他而言过于困难，于是他向你求助。你需要判断：给定的排列是否可能通过上述算法生成（假设生成器在每一步均恰好选择德尼斯所需的位置）。

The first line contains a single integer $t$ $(1 \leq t \leq 10^5)$ — the number of test cases. Then the descriptions of the test cases follow.

The first line of the test case contains a single integer $n$ $(1 \leq n \leq 10^5)$ — the size of the permutation.

The second line of the test case contains $n$ different integers $p_1, p_2, \ldots, p_n$ ($1 \leq p_i \leq n$) — the permutation written by Denis.

It is guaranteed that the sum of $n$ over all test cases doesn't exceed $10^5$.

第一行包含一个整数 $t$（$1 \leq t \leq 10^5$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 10^5$），表示排列的长度。

每个测试用例的第二行包含 $n$ 个互不相同的整数 $p_1, p_2, \ldots, p_n$（$1 \leq p_i \leq n$），即丹尼斯所写的排列。

保证所有测试用例的 $n$ 值之和不超过 $10^5$。

Print "Yes" if this permutation could be obtained as a result of the generator. Otherwise, print "No".

All letters can be displayed in any case.

如果该排列可以作为生成器的结果得到，则输出“Yes”；否则输出“No”。

所有字母均可以任意大小写形式显示。

Let's simulate the operation of the generator in the first test.

At the $1$ step, $r = [1, 2, 3, 4, 5], count = [1, 1, 1, 1, 1]$. The maximum value is reached in any free position, so the generator can choose a random position from $1$ to $5$. In our example, it chose $5$.

At the $2$ step, $r = [1, 2, 3, 4, \times], count = [1, 1, 1, 1, 0]$. The maximum value is reached in positions from $1$ to $4$, so the generator can choose a random position among them. In our example, it chose $1$.

At the $3$ step, $r = [2, 2, 3, 4, \times], count = [0, 2, 1, 1, 0]$. The maximum value is $2$ and is reached only at the $2$ position, so the generator will choose this position.

At the $4$ step, $r = [3, 3, 3, 4, \times], count = [0, 0, 3, 1, 0]$. The maximum value is $3$ and is reached only at the $3$ position, so the generator will choose this position.

At the $5$ step, $r = [4, 4, 4, 4, \times], count = [0, 0, 0, 4, 0]$. The maximum value is $4$ and is reached only at the $4$ position, so the generator will choose this position.

In total, we got a permutation of $2, 3, 4, 5, 1$, that is, a generator could generate it.

我们来模拟第一个测试用例中生成器的运行过程。

第 $1$ 步，$r = [1, 2, 3, 4, 5]$, $count = [1, 1, 1, 1, 1]$。最大值出现在任意未被占用的位置，因此生成器可从位置 $1$ 到 $5$ 中随机选择一个。在本例中，它选择了位置 $5$。

第 $2$ 步，$r = [1, 2, 3, 4, \times]$, $count = [1, 1, 1, 1, 0]$。最大值出现在位置 $1$ 至 $4$，因此生成器可在这些位置中随机选择一个。在本例中，它选择了位置 $1$。

第 $3$ 步，$r = [2, 2, 3, 4, \times]$, $count = [0, 2, 1, 1, 0]$。最大值为 $2$，且仅在位置 $2$ 处取得，因此生成器将选择该位置。

第 $4$ 步，$r = [3, 3, 3, 4, \times]$, $count = [0, 0, 3, 1, 0]$。最大值为 $3$，且仅在位置 $3$ 处取得，因此生成器将选择该位置。

第 $5$ 步，$r = [4, 4, 4, 4, \times]$, $count = [0, 0, 0, 4, 0]$。最大值为 $4$，且仅在位置 $4$ 处取得，因此生成器将选择该位置。

最终，我们得到了排列 $2, 3, 4, 5, 1$，即该生成器有可能生成此排列。