2.9 Box of Bricks（砖盒）

最新推荐文章于 2019-03-12 21:11:16 发布

云乐仙er

最新推荐文章于 2019-03-12 21:11:16 发布

阅读量378

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签： S

本文链接：https://blog.youkuaiyun.com/qq_41668789/article/details/82250464

这是一个关于计算移动砖块最小次数的问题，目的是使所有砖盒达到相同高度。Bob有50个或更少的砖盒，高度在1到100之间。输入包含砖盒数量和各自高度，需要找出最小移动次数。输出应显示数据集编号和所需移动的砖块数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2.9 Box of Bricks

2.9.1 时空限制

Time limit: 1 Seconds Memory limit: 32768K

2.9.2 题目内容

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?