CF2153A.Circle of Apple Trees

There are $n$ apple trees arranged in a circle. Each tree bears exactly one apple, and the beauty of the apple on the $i$-th tree is given by $b_i$ for all $1\le i\le n$. You start in front of tree $1$.

At each tree, you may choose to either eat the apple or skip it. After making your choice, you move to the next tree: from tree $i$, you move to tree $i+1$ for $1 \le i \le n - 1$, and from tree $n$, you move back to tree $1$. This process continues indefinitely as you move through the trees in a cycle.

However, you have a special condition: you may only eat an apple if its beauty is strictly greater than the beauty of the last apple you ate. For example, if $b = [2, 1, 2, 3]$ and you eat the apple on tree $1$ (beauty $2$), you cannot eat the apples on trees $2$ and $3$ because their beauties are not greater than $2$. However, you may eat the apple on tree $4$ since $b_4 = 3 \gt 2$.

Note that you are allowed to skip an apple when you first encounter it, and you can choose to eat it later on a subsequent cycle.

Your task is to determine the maximum number of apples you can eat if you make optimal decisions on when to eat or skip each apple.

有 $n$ 棵苹果树围成一个圆圈。每棵树上恰好结一个苹果，第 $i$ 棵树上的苹果的美丽值为 $b_i$（其中 $1 \le i \le n$）。你从第 $1$ 棵树前开始。

在每一棵树处，你可以选择吃掉该苹果，或跳过它。做出选择后，你将移动到下一棵树：从第 $i$ 棵树出发，当 $1 \le i \le n - 1$ 时，你移动到第 $i+1$ 棵树；而从第 $n$ 棵树出发时，你回到第 $1$ 棵树。这一过程无限持续，你将不断绕圈经过这些树。

但你有一个特殊限制：仅当当前苹果的美丽值严格大于你上一次吃掉的苹果的美丽值时，你才可以吃掉它。
例如，若 $b = [2, 1, 2, 3]$，且你吃了第 $1$ 棵树上的苹果（美丽值为 $2$），那么你无法吃第 $2$ 棵和第 $3$ 棵树上的苹果，因为它们的美丽值均不大于 $2$；但你可以吃第 $4$ 棵树上的苹果，因为 $b_4 = 3 > 2$。

注意：你可以在第一次经过某棵苹果树时跳过该苹果，并在后续某一轮循环中再选择吃掉它。

你的任务是：在对每个苹果的吃与跳过作出最优决策的前提下，求出你能吃到的苹果数量的最大值。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 500$). The description of the test cases follows.

The first line of each test case contains a single integer $n$ ($1 \le n\le 100$) — the number of apple trees.

The second line of each test case contains $n$ integers $b_1, b_2, \ldots, b_n$ ($1\le b_i\le n$) — the beauty of the apples on the trees.

Note that there are no constraints on the sum of $n$ over all test cases.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 500$）。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1 \le n\le 100$）—— 苹果树的数量。

每个测试用例的第二行包含 $n$ 个整数 $b_1, b_2, \ldots, b_n$（$1\le b_i\le n$）—— 各棵树上苹果的美丽值。

注意：对所有测试用例的 $n$ 之和不作任何限制。

For each test case, output a single integer representing the maximum number of apples you can eat.

对于每个测试用例，输出一个整数，表示你能吃到的苹果的最大数量。

In the first test case, since all apples have the same beauty, no matter which apple you eat first, you cannot eat any others afterward. Hence, the maximum number of apples that you can eat is $1$.

In the second test case, you can eat four apples as follows:

• At tree $1$, skip the apple.
• At tree $2$, skip the apple.
• At tree $3$, skip the apple.
• At tree $4$, eat the apple (beauty $1$).
• At tree $5$, eat the apple (beauty $2$).
• At tree $1$, skip the apple. You are not allowed to eat the apple as its beauty ($b_1 = 1$) is not greater than the beauty of the last apple you ate ($b_5 = 2$).
• At tree $2$, eat the apple (beauty $4$).
• At tree $3$, eat the apple (beauty $5$).

It can be proven that it is not possible to eat all five apples; hence, the maximum number of apples that you can eat is $4$.

在第一个测试用例中，由于所有苹果的美丽值均相同，无论你先吃哪一个苹果，之后都无法再吃其他苹果。因此，你能吃的苹果的最大数量为 $1$。

在第二个测试用例中，你可以按如下方式吃掉四个苹果：

• 在第 $1$ 棵树处，跳过该苹果。
• 在第 $2$ 棵树处，跳过该苹果。
• 在第 $3$ 棵树处，跳过该苹果。
• 在第 $4$ 棵树处，吃掉该苹果（美丽值为 $1$）。
• 在第 $5$ 棵树处，吃掉该苹果（美丽值为 $2$）。
• 在第 $1$ 棵树处，跳过该苹果。你不能吃它，因为它的美丽值（$b_1 = 1$）不大于你上一次所吃苹果的美丽值（$b_5 = 2$）。
• 在第 $2$ 棵树处，吃掉该苹果（美丽值为 $4$）。
• 在第 $3$ 棵树处，吃掉该苹果（美丽值为 $5$）。

可以证明，不可能吃掉全部五个苹果；因此，你能吃的苹果的最大数量为 $4$。