Codeforces Round #698 (Div. 2) A. Nezzar and Colorful Balls

最新推荐文章于 2025-06-06 18:51:32 发布

H_chen*

最新推荐文章于 2025-06-06 18:51:32 发布

阅读量140

点赞数 1

分类专栏： Codeforces 文章标签： c++

本文链接：https://blog.youkuaiyun.com/qq_54233803/article/details/113428737

版权

Codeforces 专栏收录该内容

9 篇文章

订阅专栏

该博客介绍了Codeforces Round #698 (Div. 2) A题——Nezzar and Colorful Balls。题目要求使用最少的颜色为球涂色，使得每种颜色的球上的数字构成严格递增序列。博客包含题目描述、输入输出格式、样例及题解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
input

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

output

3
2
4
1
1

题解：

#include<iostream>
using namespace std;
int main()
{
	int t,n,m[110]={0};
	cin>>t;
	while(t--){
		cin>>n;
		int ans=1,j=0,max=1;
		for(int i=1;i<=n;i++){
			cin>>m[i];
			if(m[i]==m[i-1]){
				ans++;
				if(ans>max)
					max=ans;
			}
			else{
				ans=1;
			}
		}
		cout<<max<<endl;
	}
	return 0;
}