A. Towers

最新推荐文章于 2021-10-12 08:57:41 发布

bupt_xycr

最新推荐文章于 2021-10-12 08:57:41 发布

阅读量609

点赞数

分类专栏： codeforces A题

本文链接：https://blog.youkuaiyun.com/u013077144/article/details/51212131

版权

codeforces A题专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一个关于使用等长木条构建最小数量塔的问题，并提供了一段C++代码实现。该问题要求利用所有给定长度的木条构造塔，相同长度的木条可以堆叠，最终输出最高塔的高度及塔的总数。

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


     
     
      
      
       
       A. Towers
      
      
      
      
       
       
        
        time limit per test
       
       2 seconds
      
      
      
      
       
       
        
        memory limit per test
       
       256 megabytes
      
      
      
      
       
       
        
        input
       
       standard input
      
      
      
      
       
       
        
        output
       
       standard output
      
      
     
     
     
     
      
      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
       
       
      
      
     
     
/* ***********************************************
Author        :
Created Time  :2015/6/15 2:27:51
File Name     :7.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;

bool cmp(int a,int b){
    return a>b;
}
int a[maxn];
int n;

int main()
{
    #ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    while(cin>>n){
		int x;
		cle(a);
		for(int i=1;i<=n;i++){
			cin>>x;
			a[x]++;
		}
		int ans=0;
		int Max=-INF;
		for(int i=1;i<=1000;i++){
			if(a[i]!=0)ans++;
			Max=max(a[i],Max);
		}
		cout<<Max<<" "<<ans<<endl;
	}
    return 0;
}