【问题】
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.【输入】
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【输出】
Line 1: The maximum number of gallons of milk that Bessie can product in the N hours
【思路】
动态规划题目,其实并不太难,但之前思路有点偏,想了半天没想出来
dp数组表示当前任务之前的最大价值,找到最大值输出即可
边初始化边进行查找取值,两层循环,一层循环把每个任务的价值赋值给dp数组,内层循环找这个任务之前的不与该任务冲突的价值最大的任务,再加上当前任务的价值,然后外层循环一直记录dp的最大值,最后将这个最大值输出即可
【源代码】
#include<iostream>
#include<cstdio>
#include<string>
#include<cstdlib>
#include<cmath>
using namespace std;
#include<stack>
#include<cstdlib>
#include<string>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<map>
#define ll long long
struct node
{
int s, e, t;
} a[10010];
bool cmp(node a, node b)
{
return a.s < b.s;
}
int dp[10010];
int jl[10010];
int main()
{
int n, m, r;
cin >> n >> m >> r;
for (int i = 0; i < m; i++)
{
cin >> a[i].s >> a[i].e >> a[i].t;
a[i].e += r;
}
sort(a, a + m, cmp);
int temp = dp[0] = a[0].t;
for (int i = 1; i < m; i++)
{
dp[i] = a[i].t;
for (int j = i - 1; j >= 0; j--)
{
if (a[j].e <= a[i].s)
dp[i] = max(dp[i], dp[j] + a[i].t);
}
temp = max(temp, dp[i]);
}
cout << temp << endl;
return 0;
}