codeforces Towers 题解

最新推荐文章于 2024-06-15 21:10:15 发布

转载最新推荐文章于 2024-06-15 21:10:15 发布 · 293 阅读

文章标签：

#数据结构与算法

本篇博客介绍了一道算法题目，任务是使用给定长度的木棒构造最少数量的塔，并确保所有木棒都被使用。文章提供了详细的解决方案，包括输入输出说明及示例。

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

Little Vasya has received a young builder’s kit. The kit consists of several wooden bars, the lengths of all of them are known. The bars can be put one on the top of the other if their lengths are the same.

Vasya wants to construct the minimal number of towers from the bars. Help Vasya to use the bars in the best way possible.

Input

The first line contains an integer N (1 ≤ N ≤ 1000) — the number of bars at Vasya’s disposal. The second line contains N space-separated integers li — the lengths of the bars. All the lengths are natural numbers not exceeding 1000.

Output

In one line output two numbers — the height of the largest tower and their total number. Remember that Vasya should use all the bars.

Sample test(s)

input
3
1 2 3

output
1 3

input
4
6 5 6 7

output
2 3

题意就是计算一个数组中的最大反复数和去重后的数据量。

所以本题就是数组去重知识的运用，和添加一个记录，记录最大反复数。

void Towers()
{
	unsigned n;
	cin>>n;
	int *A = new int[n];

	for (unsigned i = 0; i < n; i++)
	{
		cin>>A[i];
	}
	sort(A, A+n);
	int j = 1, h = 1, max_h = 1;
	for (unsigned i = 1; i < n; i++)
	{
		if (A[i] != A[i-1])
		{
			A[j++] = A[i];
			max_h = max(max_h, h);
			h = 1;
		}
		else h++;
	}
	max_h = max(max_h, h);
	cout<<max_h<<' '<<j;

	delete [] A;
}