zoukankan      html  css  js  c++  java
  • UVa 591 Box of Bricks

      Box of Bricks 

    Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you should make all stacks the same height. Then you would have a real wall.'', she retorts. After a little con- sideration, Bob sees that she is right. So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimum number of bricks moved. Can you help?

    Input 

    The input consists of several data sets. Each set begins with a line containing the number n of stacks Bob has built. The next line contains n numbers, the heights hi of the n stacks. You may assume $1 Ÿle n leŸ 50$ and$1 leŸ h_i Ÿle 100$.

    The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to rearrange the bricks such that all stacks have the same height.

    The input is terminated by a set starting with n = 0. This set should not be processed.

    Output 

    For each set, first print the number of the set, as shown in the sample output. Then print the line ``The minimum number of moves is k.'', where k is the minimum number of bricks that have to be moved in order to make all the stacks the same height.

    Output a blank line after each set.

    Sample Input 

    6
    5 2 4 1 7 5
    0
    

    Sample Output 

    Set #1
    The minimum number of moves is 5.
    

    Miguel A. Revilla 
    1998-03-10

    求平均数后做差再求和即可……

     1 #include<iostream>
     2 #include<cstdio>
     3 
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     int n;
     9     int kase=0;
    10     int brick[200];
    11 
    12     while(scanf("%d",&n)&&n)
    13     {
    14         kase++;
    15         int total=0;
    16         for(int i=0;i<n;i++)
    17         {
    18             scanf("%d",&brick[i]);
    19             total+=brick[i];
    20         }
    21         int ave=total/n;
    22         int ans=0;
    23         for(int i=0;i<n;i++)
    24             if(brick[i]>ave)
    25                 ans+=brick[i]-ave;
    26         printf("Set #%d
    ",kase);
    27         printf("The minimum number of moves is %d.
    
    ",ans);
    28     }
    29 
    30     return 0;
    31 }
    [C++]
  • 相关阅读:
    HDU 2045 不容易系列之(3)—— LELE的RPG难题 (递推)
    HDU 2050 折线分割平面 (递推)
    HDU 5441 Travel (并查集+数学+计数)
    HDU 4597 Play Game (DP,记忆化搜索,博弈)
    HDU 4599 Dice (概率DP+数学+快速幂)
    HDU 4497 GCD and LCM (数学,质数分解)
    UVa 1312 Cricket Field (枚举+离散化)
    HDU 4499 Cannon (暴力求解)
    HDU 4496 D-City (并查集)
    javascript你不知道的知识点
  • 原文地址:https://www.cnblogs.com/lzj-0218/p/3517035.html
Copyright © 2011-2022 走看看