该博客主要介绍了POJ 3616 Milking Time问题的解决方法，强调了动态规划的运用。作者指出在解题过程中需要注意三个关键点：一是DP数组的初始化应根据每个时间段的数据；二是最优解可能不在最后，需要在每一步更新最大产值；三是题目中时间段需按开始时间排序。通过这些提示，读者可以更好地理解和解决此类问题。
Milking Time
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5507 Accepted: 2304
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 gallons of milk that he can get out of Bessie in that interval. Farmer John starts and stops milking at the beginning of the starting hour and ending hour, respectively. When being milked, Bessie must be milked through an entire interval.
Even Bessie has her limitations,
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 5507 Accepted: 2304
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 gallons of milk that he can get out of Bessie in that interval. Farmer John starts and stops milking at the beginning of the starting hour and ending hour, respectively. When being milked, Bessie must be milked through an entire interval.
Even Bessie has her limitations,
最低0.47元/天 解锁文章
285
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
