这篇博客探讨了如何通过区间动态规划（dp）方法优化Bessie奶牛的挤奶时间，以在限定的N小时内获得最大牛奶产量。考虑了农民John的可用挤奶时段及其效率，以及Bessie挤奶后的休息时间R，求解最大牛奶产量。
Description
Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces as much milk as possible.
Farmer John has a list of M (1 ≤ M ≤ 1,000) possibly overlapping intervals in which he is available for milking. Each interval i has a starting hour (0 ≤ starting_houri ≤ N), an ending hour (starting_houri < ending_houri ≤ N), and a corresponding efficiency (1 ≤ efficiencyi ≤ 1,000,000) which indicates how many gallon
最低0.47元/天 解锁文章
扫一扫
231
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
