Codeforces 389C Fox and Box Accumulation【贪心】
来源:互联网 发布:c语言中数据类型与% 编辑:程序博客网 时间:2024/05/21 10:08
Fox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. Thei-th box can hold at most xi boxes on its top (we'll callxi the strength of the box).
Since all the boxes have the same size, Ciel cannot put more than one box directly on the top of some box. For example, imagine Ciel has three boxes: the first has strength 2, the second has strength 1 and the third has strength 1. She cannot put the second and the third box simultaneously directly on the top of the first one. But she can put the second box directly on the top of the first one, and then the third box directly on the top of the second one. We will call such a construction of boxes apile.
Fox Ciel wants to construct piles from all the boxes. Each pile will contain some boxes from top to bottom, and there cannot be more thanxi boxes on the top ofi-th box. What is the minimal number of piles she needs to construct?
The first line contains an integer n (1 ≤ n ≤ 100). The next line containsn integers x1, x2, ..., xn (0 ≤ xi ≤ 100).
Output a single integer — the minimal possible number of piles.
30 0 10
2
50 1 2 3 4
1
40 0 0 0
4
90 1 0 2 0 1 1 2 10
3
In example 1, one optimal way is to build 2 piles: the first pile contains boxes 1 and 3 (from top to bottom), the second pile contains only box 2.
In example 2, we can build only 1 pile that contains boxes 1, 2, 3, 4, 5 (from top to bottom).
题目大意:
一共已知有N个盒子,每个盒子都有对应能够承受的压力值,假设一个盒子的压力值为4,那么其可以承担上边的盒子数就是4个,问最多需要摞几摞、
思路:
1、我们首先可以明确一点,让承受压力值低的放在上边,那么我们将盒子按照承受压力值从小到大排序。
2、然后我们用vis【i】表示第i个盒子是否已经用过了,那么我们从第一个盒子开始摞,向后扫压力值大于1的第一个盒子,然后再向后扫,找压力值大于2的第一个盒子..................依次类推,将已经用过的盒子对应vis【i】=1.标记用过了。
那么起点数,就是最少的摞数。
Ac代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int vis[150];int a[150];int main(){ int n; while(~scanf("%d",&n)) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); } int output=0; sort(a,a+n); memset(vis,0,sizeof(vis)); for(int i=0;i<n;i++) { if(vis[i]==1)continue; vis[i]=1; output++; int cnt=1; for(int j=i+1;j<n;j++) { if(vis[j]==1)continue; if(a[j]>=cnt) { vis[j]=1; cnt++; } } } printf("%d\n",output); }}
- Codeforces 389C Fox and Box Accumulation【贪心】
- [Codeforces] 389C - Fox and Box Accumulation
- codeforces Fox and Box Accumulation
- codeforces Fox and Box Accumulation
- Fox and Box Accumulation CodeForces
- Codeforces 388A Fox and Box Accumulation(贪心)
- Codeforces 388A Fox and Box Accumulation(贪心)
- 贪心-codeforces-388A-Fox and Box Accumulation
- CodeForces 388A Fox and Box Accumulation(贪心)
- CodeForces 388A Fox and Box Accumulation 贪心
- Codeforces Round #228 (Div. 2) C Fox and Box Accumulation(贪心)
- Codeforces #228 (Div. 2)C. Fox and Box Accumulation
- Codeforces Round #228 (Div. 2)C. Fox and Box Accumulation
- Codeforces Round #228 (Div. 2)C. Fox and Box Accumulation
- CodeForces 388A Fox and Box Accumulation
- CodeForces 388A Fox and Box Accumulation
- codeforces-388A-Fox and Box Accumulation
- Fox and Box Accumulation
- 根据父布局的宽高,动态设置控件的宽高
- Android USB Camera(1) : 调试记录
- shell脚本中的反引号,单引号,双引号与反斜杠
- Java 并发 教程 - 多线程的代价
- 2016.11.5初中部上午NOIP普及组比赛总结
- Codeforces 389C Fox and Box Accumulation【贪心】
- node js简单爬虫实现
- 简单的租车系统
- Rust 1.12 发布
- 设计模式
- c语言编程常犯的<8大错误>
- bzoj1009: [HNOI2008]GT考试
- hosts文件详解
- configure: error: Cannot find php-config