[Monotonous queue] HDU 4122 Alice's mooncake shop

Channel: http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 4122

Given N and M, there are N orders. You can make moon cakes at M time. The time is calculated by hour. You can make several moon cakes at any time. Next, N actions are performed on N orders, including the time and quantity. Given T and S, it indicates the warranty time of each moon cake and the overhead of every one hour. Then M behavior corresponds to the cost of making moon cakes at every moment. How much is required to complete all orders

Train of Thought: maintain a monotonous queue and drop the pop that does not meet the requirements during the fresh-keeping period.

Code:Https://github.com/Mithril0rd/Rojo/blob/master/hdu4122.cpp

TAG: Thanks to Hua Ge and Xin Ge.

[Monotonous queue] HDU 4122 Alice's mooncake shop