Mike Time挤奶时间 -- DP

题目描述

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.

奶牛Bessie在0~N时间段产奶。农夫约翰有M个时间段可以挤奶，时间段f,t内Bessie能挤到的牛奶量e。奶牛产奶后需要休息R小时才能继续下一次产奶，求Bessie最大的挤奶量。

输入格式

• 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

输入输出样例

输入
12 4 2
1 2 8
10 12 19
3 6 24
7 10 31
输出
43

因为这道题m比较小，我们就考虑对m做DP，在我看了思路像背包，
设状态f[i] 为选第i个区间时，能获得的最大价值，那么显然的是，两个重合的区间时不能同时选，那么我们就先将区间排序，枚举不重合之前的区间更新出来的最优解，取max，因为状态是选第i个区间吗，所以f[i]一定要加上第i个数的价值。
最后在1~m之间找到最大值，然后输出答案。
$$Code$$

#include<bits/stdc++.h>

#define MAXN 10000001
#define ll long long
#define gtc() getchar()
#define INF 0x3f3f3f3f
#define N 1001

using namespace std;

struct node{
	int l, r, w;
}q[N];
int n, m, r;

bool cmp(node a, node b){
	return a.l == b.l ? a.r < a.r : a.l < b.l;
}
int f[MAXN];
int main()
{
	cin >> n >> m >> r;
	for(int i = 1; i <= m; ++i){
		cin >> q[i].l >> q[i].r >> q[i].w;
	}
	sort(q + 1, q + m + 1, cmp);
		
	for(int i = 1; i <= m; ++i){
		for(int j = 1; j < i; ++j){
			if(q[j].r <= q[i].l - r) f[i] = max(f[i], f[j]);
		}
			f[i] += q[i].w;
	}
	int ans = 0;
	for(int i = 1; i <= m; ++i){
		ans = max(ans, f[i]);
	}
	
	cout << ans << endl;
	return 0;
}