903C Boxes Packing

C. Boxes Packing

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.

Mishka can put a box i into another box j if the following conditions are met:

i-th box is not put into another box;
j-th box doesn't contain any other boxes;
box i is smaller than box j (ai < aj).

Mishka can put boxes into each other an arbitrary number of times. He wants to minimize the number of visible boxes. A box is called visible iff it is not put into some another box.

Help Mishka to determine the minimum possible number of visible boxes!

Input

The first line contains one integer n (1 ≤ n ≤ 5000) — the number of boxes Mishka has got.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the side length of i-th box.

Output

Print the minimum possible number of visible boxes.

Examples

input

3
1 2 3

output

input

4
4 2 4 3

output

Note

In the first example it is possible to put box 1 into box 2, and 2 into 3.

In the second example Mishka can put box 2 into box 3, and box 4 into box 1.

题意：给你n个盒子，把小盒子放进大的盒子里，这样只能看到大盒子，输出最小能够有看到的盒子数。

题解：最开始想的是排序，前面一个比后面小就能放，否则不能放，输出盒子个数加1，但是这样不仅时间会超，而且有思维漏洞，
10
86 89 89 86 86 89 86 86 89 89这组数据那样算，输出9，而正确答案是5，因为相同的盒子可以放进比它大的盒子里，再放进大盒子里。所以用map处理标记每个盒子
出现次数，取最大的也是结果。

#include<bits/stdc++.h>
using namespace std;
map<int,int>m;
int main()
{int n,ans,a;while(cin>>n){ans=0;m.clear();for(int i=0; i<n; i++){cin>>a;m[a]++;ans=max(m[a],ans);}cout<<ans<<endl;}return 0;
}

903C Boxes Packing相关推荐

Boxes Packing
Boxes Packing Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side le ...
CF1066D Boxes Packing
传送门这题为什么要用二分呢?/huaji 首先可以\(O(n)\)预处理出从某个物品\(i\)开始放,只放一个盒子,能放的最后物品的位置\(j\),只要用两个指针维护左右端点,每次移动一下左端点同时 ...
Codeforces 题目合集+分类+代码【Updating...】【361 in total】
961A - Tetris 模拟 ...
C-Boxes packing
C. Boxes Packing time limit per test 1 second memory limit per test 256 megabytes input standard inp ...
Codeforces Round #515 (Div. 3)【未完结】
2022.3.9 题单地址:https://codeforces.com/contest/1066 目录 A. Vova and Train[思维] B. Heaters[贪心] C. Books Q ...
【论文阅读30】-《Autocuts: Simultaneous Distortion and Cut Optimization for UV Mapping》
目录 0 摘要 1 introduction 2 related work 2.1 Minimizing distortion 2.2 Optimizing cuts 2.2.1 Cuts for r ...
怎样利用计算机模拟掷骰子实验,概率论实验报告-随机数模拟掷骰子.doc
数学与统计学院实验报告院(系):数学与统计学院学号: 姓名: 实验课程: 概率论与数理统计指导教师: 实验类型(演示性.验证性.综合性.设计性):演示性实验时间:2013年09月18日一.实 ...
【CodeForces - 270C】Magical Boxes （思维，进制，有坑）
题干: Emuskald is a well-known illusionist. One of his trademark tricks involves a set of magical boxe ...
HDU - 1613 Ecological Bin Packing
问题描述: Background Bin packing, or the placement of objects of certain weights into different bins sub ...
Anchor Boxes示例实战
Anchor Boxes示例实战目标检测算法通常对输入图像中的大量区域进行采样,判断这些区域是否包含感兴趣的目标,并调整这些区域的边缘,以便更准确地预测目标的真实边界框.不同的模型可能使用不同的区域 ...

903C Boxes Packing

903C Boxes Packing相关推荐

最新文章

热门文章