# Codeforces Round 698 A 题解

## Nezzar and Colorful Balls

Nezzar has $n$ balls, numbered with integers $1,2,…,n$. Numbers $a_1,a_2,…,a_n$ are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that $a_i≤a_{i+1}$ for all $1≤i<n$.

Nezzar wants to color the balls using the minimum number of colors, such that the following holds.

• For any color, numbers on balls will form a strictly increasing sequence if he keeps balls with this chosen color and discards all other balls.

Note that a sequence with the length at most $1$ is considered as a strictly increasing sequence.

### Input

The first line contains a single integer $t$ ($1≤t≤100$) — the number of testcases.

The first line of each test case contains a single integer $n$ ($1≤n≤100$).

The second line of each test case contains $n$ integers $a_1,a_2,…,a_n$ ($1≤a_i≤n$). It is guaranteed that $a_1≤a_2≤…≤a_n$.

### Output

For each test case, output the minimum number of colors Nezzar can use.

input

output

### Note

Let's match each color with some numbers. Then:

In the first test case, one optimal color assignment is $[1,2,3,3,2,1]$.

In the second test case, one optimal color assignment is $[1,2,1,2,1]$.

## AC代码

Codeforces Round 698 A 题解

https://mmdjiji.com/2021/01/2901/

2021-01-29

2022-12-10