Minimum Queue with Constant Increment

最新推荐文章于 2023-02-25 23:03:36 发布

taoqick

最新推荐文章于 2023-02-25 23:03:36 发布

阅读量676

点赞数 1

分类专栏：算法 c++

本文链接：https://blog.csdn.net/taoqick/article/details/45673195

版权

算法同时被 2 个专栏收录

474 篇文章 6 订阅

订阅专栏

c++

265 篇文章 1 订阅

订阅专栏

There's a factory for cakes. Every day, the cost of producing a cake is different. The factory could produce as more as cakes in one day and the producing cost for cakes in the same day is the same. The shelf life for each cake is s days and the storage fee for each cake is t dollars.

How to fulfill the customers' paying list with the minimum cost?

-----------------------------------------------------------------------------------

We could use a minimum queue to calculate the cost of day i+s as arr[i+s]. However, if we want to know arr[i+s+1], we have to refresh i+2 to i+s, i.e., we always calculates the minimum value of

a[i+1] + (s-1)t

a[i+2] + (s-2)t

a[i+3] + (s-3)t

....

a[i+s] + 0t

Actually, there is no need to refresh i+2 to i+s. Another way is to refresh a[1] to end with adding a list of nt, (n-1)t.....0t in the beginning. Then minimum queue could used later.