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, though. After being milked during any interval, she must rest R (1 ≤ R ≤ N) hours before she can start milking again. Given Farmer Johns list of intervals, determine the maximum amount of milk that Bessie can produce in the N hours.
Input
- Line 1: Three space-separated integers: N, M, and R
- Lines 2…M+1: Line i+1 describes FJ’s ith milking interval withthree space-separated integers: starting_houri , ending_houri , and efficiencyi
Output
- Line 1: The maximum number of gallons of milk that Bessie can product in the N hours
Sample Input
12 4 2
1 2 8
10 12 19
3 6 24
7 10 31
Sample Output
43
题意
给定一个时间段,给出m短时间的工作量和起止时刻,每段工作结束之后需要休息R时间段,求解最大工作量。
AC代码
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int MAX = 1005;
typedef struct
{
int Sta, End, val;
}node;//定义结构体,包含每个时间段的工作量和起止时刻
node cow[MAX];
int dp[MAX];
int cmp(node a, node b)
{
return a.End < b.End;//按照结束时刻从小到大排列
}
int main()
{
int n, m ,r;
scanf("%d%d%d", &n, &m, &r);
for (int i = 0; i < m; ++i)
scanf("%d%d%d", &cow[i].Sta, &cow[i].End, &cow[i].val);//输入数据
sort(cow, cow + m, cmp);//排序
for (int i = 0; i < m; ++i)
dp[i] = cow[i].val;//赋初值
int max_num = 0;
for (int i = 0; i < m; ++i)//区间长度
{
for (int j = i + 1; j < m; ++j)//枚举起点
{
if (cow[i].End + r <= cow[j].Sta)
dp[j] = max(dp[j], dp[i] + cow[j].val);取所有能够正常工作情况的最大值
}
max_num = max(max_num, dp[i]);//取最大值和第i的最大值
}
printf("%d\n", max_num);
return 0;
}