# [USACO07NOV]挤奶的时间Milking Time

2021年09月15日 阅读数：5

dp[i] 到第i个时间段的最大产奶量git

```#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;

#define N 1001

int dp[N];

struct node
{
int l,r,w;
}e[N];

{
x=0; char c=getchar();
while(!isdigit(c)) c=getchar();
while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); }
}

bool cmp(node p,node q)
{
return p.r<q.r;
}

int main()
{
int n,m,R;
sort(e+1,e+m+1,cmp);
for(int i=1;i<=m;++i)
{
dp[i]=max(dp[i-1],e[i].w);
for(int j=1;j<i;++j)
if(e[j].r+R<=e[i].l)
dp[i]=max(dp[j]+e[i].w,dp[i]);
}
cout<<dp[m];
}```

## 题目描述

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.ide

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.spa

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.rest

## 输入输出格式

• Line 1: Three space-separated integers: N, M, and Rci

• 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`