codeforces Towers 题解
2014-05-01 07:20
204 查看
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
output
input
output
题意就是计算一个数组中的最大重复数和去重后的数据量。
所以本题就是数组去重知识的运用,和增加一个记录,记录最大重复数。
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 ; 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; }
相关文章推荐
- Xperience UI 设计理念:优雅的 Linux 桌面设计欣赏
- 精简Linux文件路径
- (转载) 好的程序员到底好在哪里?
- 如何在Linux命令行下查询字典?
- Introdution to 3D Game Programming With DirectX11 第15章 习题解答
- Introdution to 3D Game Programming With DirectX11 第14章 习题解答
- Introdution to 3D Game Programming With DirectX11 第13章 习题解答
- Introdution to 3D Game Programming With DirectX11 第12章 习题解答
- 在Gridview中输入小数时报对于int32 太大或太小
- Caching Tutorial
- 使用eclipse WTP内置的Web Services Explorer测试SOAP based Web Services
- android 格式化输入控制
- First Missing Positive
- 答一名总是半途而废的大二学生:如何坚持,坚持什么
- vimrc
- //------------集合------------------------------------------
- 不要因为没有为开源事业做贡献而感到内疚
- 不要因为没有为开源事业做贡献而感到内疚
- eclipse c++
- Eclipse使用