Boxes Packing (CodeForces - 903C)

最新推荐文章于 2024-10-16 00:00:43 发布

ananan0823

最新推荐文章于 2024-10-16 00:00:43 发布

阅读量864

点赞数 20

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/dskklklf/article/details/134866294

版权

第一周题单

H - Boxes Packing (CodeForces - 903C)

Mishka has got n empty boxes. For every $i (1 \leq i \leq n)$ , $i$ -th box is a cube with side length $a_i$ .
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 (a_i < a_j)$ .

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 \leq n \leq 5000)$ — the number of boxes Mishka has got.
The second line contains $n$ integers $a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9)$ , where ai is the side length of $i$ -th box.

Output

Print the minimum possible number of visible boxes.

Simple1

Input

3
1 2 3

Output

1

Simple2

Input

4
4 2 4 3

Output

2

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$ ，把箱子 $i$ 放进 $j$ 需要满足一下条件：

第 i 个盒子没有放入另一个盒子中；
第 j 个盒子不包含任何其他盒子；
$a_i<a_j$ ；

放进其他箱子的箱子为不可见，问最后有几个箱子可见

题解过程

用容器vector承接所有箱子的边长，然后对所有的箱子按边长升序排列，最后模拟整个放入过程，每次将箱子放入其他箱子后擦除本箱子，最后擦除那个可见的箱子并计数

代码部分(cpp)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> boxes;
bool cmp(int a, int b)
{
    return a < b;
}
void solution()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int temp;
        cin >> temp;
        boxes.push_back(temp);
    }
    sort(boxes.begin(), boxes.end(), cmp);
    int num = 0;
    while (boxes.size() != 0)
    {
        // 遍历
        auto temp = boxes.begin();
        for (auto i = next(boxes.begin()); i != boxes.end(); i++)
        {
            if (*temp < *i)
            {
                boxes.erase(temp);
                i--;
                temp = i;
            }
        }
        // 擦除最大数 即可见的那一个箱子
        boxes.erase(temp);
        num++;
    }
    cout << num;
}
int main(int argc, const char **argv)
{
    solution();
    return 0;
}