Sand Fortress CodeForces - 985D (二分枚举答案+等差数列的求和)

最新推荐文章于 2021-11-18 08:57:42 发布

Levi——

最新推荐文章于 2021-11-18 08:57:42 发布

阅读量352

点赞数

分类专栏：二分

本文链接：https://blog.csdn.net/qq_41874469/article/details/80472641

版权

该博客探讨如何在二维数轴上使用有限沙袋建造一面满足特定条件的沙墙。条件包括左侧围墙高度、相邻高度差不超过1以及消耗所有沙袋。博主提出通过二分枚举区间长度并验证两种可能的沙墙形态（单调递减和先增后减）来确定最小占用位置数。文章提供了有效和无效案例以加深理解，并附带解题思路和代码实现。

摘要由CSDN通过智能技术生成

https://blog.csdn.net/weixin_39453270/article/details/80433626

参考了Chen_Jr_dalao的博客！！！！！！（附上我一点浅显的理解）

D. Sand Fortress

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are going to the beach with the idea to build the greatest sand castle ever in your head! The beach is not as three-dimensional as you could have imagined, it can be decribed as a line of spots to pile up sand pillars. Spots are numbered 1 through infinity from left to right.

Obviously, there is not enough sand on the beach, so you brought n packs of sand with you. Let height hi of the sand pillar on some spot ibe the number of sand packs you spent on it. You can't split a sand pack to multiple pillars, all the sand from it should go to a single one. There is a fence of height equal to the height of pillar with