杭电1326-Box of Bricks
来源:互联网 发布:美图秀秀mac 编辑:程序博客网 时间:2024/06/02 22:19
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.
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.
Output a blank line after each set.
Sample Input
65 2 4 1 7 50英文题目,所以必须给解释:题目其实很简单就是给你一些高低不平的盒子,怎样才能使他们一样高用最少的移动次数这里有个诀窍:就是不管怎样移动:移动的盒子个数是固定的,所以最少的移动次数也是固定的即:每个位置的盒子与摆放好的平均盒子个数之差的绝对值的和再除以2就是所需最少移动次数下面看AC代码:#include<iostream>#include<cmath>const int MAX=300;int x[MAX];using namespace std;int main(){int n,m,sum,p=1;while(cin>>n&&n){m=0;sum=0;for(int i=0;i<n;i++){cin>>x[i];sum+=x[i];}sum/=n;for(int i=0;i<n;i++){m+=abs(x[i]-sum);}cout<<"Set #"<<p++<<endl;cout<<"The minimum number of moves is "<<m/2<<"."<<endl;cout<<endl;}return 0;}
- 杭电1326-Box of Bricks
- 杭电 HDU ACM 1326 Box of Bricks
- 杭电 2088 Box of Bricks
- 杭电 acm Box of Bricks
- 杭电oj-Box of Bricks
- HDU 1326 Box of Bricks
- hdoj 1326 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- hd 1326 Box of Bricks
- HDU 1326 Box of Bricks
- hdu 1326 Box of Bricks
- 航电ACM step1.2.3 Box of bricks
- hdu-oj 1326 Box of Bricks
- hdoj.1326 Box of Bricks 20140819
- HDU 1326 Box of Bricks(数学题)
- HDOJ 1326 Box of Bricks(简单题)
- HDU 1326 Box of Bricks(水题)
- 黑马程序员__JAVA基础加强__高新技术(二)
- c++快捷键大全
- net 命令
- 分离字符串到数组
- Acm 蜗牛!快爬!我的方法
- 杭电1326-Box of Bricks
- Xcode常用快捷方式
- ubuntu常见命令
- Sql Server datetime 常用日期格式转换
- 实用Shell命令备忘
- windowserver2008装oracle后本地能访问,客户端访问报无监听解决办法
- C++获取当前时间int类型
- Android中dip、dp、px、sp和屏幕密度简介
- UNIX环境高级编程——进程基本概述