zoukankan      html  css  js  c++  java
  • HDU 2088 Box of Bricks(脑洞)

    传送门:

    http://acm.hdu.edu.cn/showproblem.php?pid=2088

    Box of Bricks

    Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 20219    Accepted Submission(s): 6473


    Problem Description
    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 consideration, 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≤n≤50 and 1≤hi≤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, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.
    Output a blank line between each set.
     
    Sample Input
    6 5 2 4 1 7 5 0
     
    Sample Output
    5
     
    Author
    qianneng
     
    Source
     
    分析:
    当时确实没有想到
    小于平均的栈其差多少的和就是需要移动的总数
    code:
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    #define max_v 50
    int a[max_v];
    int main()
    {
        int n,k=0;
        while(~scanf("%d",&n))
        {
            if(n==0)
                break;
            if(k)
                printf("
    ");//注意输出格式,最后一个测试不能有空行
            int sum=0;
            for(int i=0; i<n; i++)
            {
                scanf("%d",&a[i]);
                sum+=a[i];
            }
            sum/=n;//平均
            int c=0;
            for(int i=0; i<n; i++)
            {
                if(a[i]<sum)//小于平均的栈其差多少的和就是需要移动的总数
                    c+=(sum-a[i]);
            }
            printf("%d
    ",c);
            k++;
        }
        return 0;
    }
     
  • 相关阅读:
    钉钉 LDAP
    OpenLDAP 密码策略与审计控制
    Active Directory LDAP DingDing
    Linux kill 命令 java
    Memory Analyzer 与 Java VM 版本支持问题
    java.lang.Thread.State
    稻盛和夫 活法 人生公式
    [领导力/管理]一句话说带团队
    把某个公司git项目迁移到gitee的步骤
    Protocol Buffers  |  Google Developers
  • 原文地址:https://www.cnblogs.com/yinbiao/p/9307528.html
Copyright © 2011-2022 走看看