zoukankan      html  css  js  c++  java
  • Codeforces Round #228 (Div. 1)_A题

                                  A. Fox and Box Accumulation
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Fox Ciel has n boxes in her room. They have the same size and weight, but they might have different strength. The i-th box can hold at most xi boxes on its top (we'll call xi 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 a pile.

    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 than xi boxes on the top of i-th box. What is the minimal number of piles she needs to construct?

    Input

    The first line contains an integer n (1 ≤ n ≤ 100). The next line contains n integers x1, x2, ..., xn (0 ≤ xi ≤ 100).

    Output

    Output a single integer — the minimal possible number of piles.

    Sample test(s)
    input
    3
    0 0 10
    output
    2
    input
    5
    0 1 2 3 4
    output
    1
    input
    4
    0 0 0 0
    output
    4
    input
    9
    0 1 0 2 0 1 1 2 10
    output
    3

     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<cstring>
     4 using namespace std;
     5 
     6 int a[104];
     7 bool vis[104];
     8 int main()
     9 {
    10     int n;
    11     while(scanf("%d",&n)!=EOF)
    12     {
    13         memset(vis,false,sizeof(vis));
    14         for(int i=0;i<n;i++)
    15             scanf("%d",&a[i]);
    16         int num;
    17         int ans=0;
    18         sort(a,a+n);
    19         for(int j=1;j<=n;j++)
    20         {
    21             bool update=false;
    22             num=0;
    23             for(int i=0;i<n;i++)
    24             {
    25                 if(!vis[i]&&a[i]>=num)
    26                 {
    27                     vis[i]=true;
    28                     num++;
    29                     update=true;
    30                 }
    31             }
    32             if(update)
    33                 ans++;
    34             else
    35                 break;
    36         }
    37         printf("%d
    ",ans);
    38     }
    39     return 0;
    40 }




  • 相关阅读:
    nginx的linux服务器内核参数调整【转】
    从运维角度来分析mysql数据库优化的一些关键点【转】
    10 个 MySQL 经典错误【转】
    keepalived的vip无法ping通【原创】
    MySQL数据库的锁详解【转】
    CGI,FastCGI,PHP-CGI与PHP-FPM区别详解【转】
    vim块编辑删除、插入、替换【转】
    Keepalived两节点出现双VIP情况及解决方法【原创】
    通过全备+relaylog同步恢复被drop的库或表【转】
    MySQL伪master+Binlog+同步【转】
  • 原文地址:https://www.cnblogs.com/-maybe/p/4264330.html
Copyright © 2011-2022 走看看