Box of Bricks最小移动砖块数目

Posted ly_rabbit

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Box of Bricks最小移动砖块数目相关的知识,希望对你有一定的参考价值。

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

#include<stdio.h> void sort(int *a,int n); int a[51]; void main() { int n; while(scanf("%d",&n)==1 && n!=0) { int i,j=0,arev=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); arev+=a[i]; } arev=arev/n; sort(a,n); while(a[n-1]>arev) { if(a[n-1]-arev>arev-a[0]) { j+=(arev-a[0]); a[n-1]=a[n-1]-(arev-a[0]); a[0]=arev; } else if(a[n-1]-arev==arev-a[0]) { j+=(arev-a[0]); a[n-1]=arev; a[0]=arev; } else { j+=(a[n-1]-arev); a[0]=+a[0]+a[n-1]-arev; a[n-1]=arev; } sort(a,n); } printf("%d\n\n",j); } } void sort(int *a,int n) { int i,j; for(i=0;i<n-1;i++) for(j=i+1;j<n;j++) { if(a[i]>a[j]) { int temp=a[i]; a[i]=a[j]; a[j]=temp; } } }

 

以上是关于Box of Bricks最小移动砖块数目的主要内容,如果未能解决你的问题,请参考以下文章

HDU 1326 Box of Bricks(水~平均高度求最少移动砖)

hdu ACM Steps 1.2.4 Box of Bricks

zoj 1251 Box of Bricks

HDU 2088 Box of Bricks(脑洞)

1177: 零起点学算法84——Box of Bricks

I - Secret Number (注意输出格式的方法)(在E-Box of Bricks中有)