原题:
C. Boxes Packing
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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
1
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个盒子,每个盒子有尺寸ai,大的盒子可以把小的盒子装下。现在问你在尽量装盒子的情况下,最后能剩下多少个盒子。
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
struct box
{
int s;
bool in;
box()
{
s=0;
in=false;
}
};
box b[5001];
int cmp(const box &b1,const box &b2)
{
return b1.s<b2.s;
}
int main()
{
ios::sync_with_stdio(false);
int n;
while(cin>>n)
{
memset(b,0,sizeof(box));
for(int i=1;i<=n;i++)
{
cin>>b[i].s;
b[i].in=false;
}
sort(b+1,b+1+n,cmp);
int cnt=n;
for(int i=1;i<=n;i++)
{
int tmp=i;
if(b[i].in)
continue;
for(int j=i+1;j<=n;j++)
{
if(b[j].s>b[tmp].s&&!b[j].in)
{
b[j].in=1;
tmp=j;
cnt--;
}
}
}
cout<<cnt<<endl;
}
return 0;
}
解答:
先按照盒子尺寸从小到大排序,小的盒子装在比它稍微大一点的盒子里,盒子里面有盒子的进行标记,最后查一查剩下多少个盒子就可以了