codeforces 37A Towers

最新推荐文章于 2018-05-01 18:56:08 发布

原创最新推荐文章于 2018-05-01 18:56:08 发布 · 489 阅读

0 ·

CC 4.0 BY-SA版权

ACM算法_STL 专栏收录该内容

9 篇文章

订阅专栏

本篇介绍了一道编程题目，任务是使用给定数量的木条构造尽可能高的塔，并且要达到塔的数量最少。通过输入不同长度的木条，程序会输出最高的塔的高度以及塔的总数。

点击打开链接

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.

题意：给出n个栅栏，相同长度的叠放在一起，求最大的塔的高度及有多少个塔.

#include<stdio.h>
#include<set>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
    map<int,int>ff;
    set<int>ss;
    int n,s[1010];
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&s[i]);
        ff[s[i]]++;
        ss.insert(s[i]);
    }
    int ma=0;
    for(int i=0;i<n;i++)
    {
        ma=max(ma,ff[s[i]]);
    }
    printf("%d %d\n",ma,ss.size());
    return 0;
}