HDU1326:Box of Bricks

原创 2013年04月16日 15:14:03
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 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 <= 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, 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.
 


 

我的思路很简单,首先排序,然后如下处理

 

#include <stdio.h>
#include <algorithm>
using namespace std;

int main()
{
    int n,cas = 1;
    while(~scanf("%d",&n),n)
    {
        int a[100],i,sub = 0;
        for(i = 0;i<n;i++)
        {
            scanf("%d",&a[i]);
            sub+=a[i];
        }
        sub = sub/n;
        sort(a,a+n);
        int sum = 0;
        printf("Set #%d\nThe minimum number of moves is ",cas++);
        while(a[n-1]>sub)
        {
            if(a[n-1]-sub>sub - a[0])//最大的达到平均值时多出的比最小的欠缺的多,把小的补满,大的统计剩余的
            {
                sum+=sub-a[0];
                a[n-1] = a[n-1] - (sub-a[0]);
            }
            else if(a[n-1]-sub == sub - a[0])//相等则两两补满
            {
                sum+=a[n-1]-sub;
                a[n-1] = sub;
                a[0] = sub;
            }
            else//小于,则先把最大的变成平均,多出的移到最少
            {
                sum += a[n-1] - sub;
                a[n-1] = sub;
                a[0] = a[0] + a[n-1] - sub;
            }
            sort(a,a+n);//每次都排序一次
        }
        printf("%d.\n\n",sum);
    }

    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

uva 591 Box of Bricks(求平均值)

Box of Bricks  Little Bob likes playing with his box of bricks. He puts the bricks one upon a...

Box of Bricks 2088

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/O...

HDU 1326 Box of Bricks(水题)

Box of Bricks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDU 1326 Box of Bricks

平均值,整型计算

水题 ~ HDU 1326 Box of Bricks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submissio...

杭电 HDU ACM 1326 Box of Bricks

Box of Bricks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • lsgqjh
  • lsgqjh
  • 2015年04月03日 23:43
  • 411

杭电1326-Box of Bricks

Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stac...

HDU 2088 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU 1.2.2 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...

HDU 2088 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU1326:Box of Bricks
举报原因:
原因补充:

(最多只允许输入30个字)