A. Nezzar and Colorful Balls

A. Nezzar and Colorful Balls
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
Nezzar has n balls, numbered with integers 1,2,…,n. Numbers a1,a2,…,an are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that ai≤ai+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.

Please help Nezzar determine the minimum number of colors.

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 a1,a2,…,an (1≤ai≤n). It is guaranteed that a1≤a2≤…≤an.

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

Example
inputCopy
5
6
1 1 1 2 3 4
5
1 1 2 2 3
4
2 2 2 2
3
1 2 3
1
1
outputCopy
3
2
4
1
1
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].

很简单，只要求出数字重复最多的次数即可。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,x,a[1001],ans,t;
int main()
{
	cin>>t;
	while (t--)
	{
			cin>>n;
	memset(a,0,sizeof(a));
	ans=0;
	for (int i=1;i<=n;i++) 
	{
		cin>>x;
		a[x]++;
	}
	for (int i=1;i<=n;i++) ans=max(ans,a[i]);
	cout<<ans<<endl;
	}

}
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24