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 Nhours
Sample Input
12 4 2
1 2 8
10 12 19
3 6 24
7 10 31
Sample Output
43
题意:在N时间内,有M组时间段,每个时间段对应一个价值,要求某个时间段的结束时间与另一个段的开始时间间隔大于等于R,对应价值相加,求最后能得到的最大价值的和。
思路:先按照结束时间,把时间段按升序排列,然后将第一个时间段的结束时间赋值给dp[0],dp[i]表示从开始取到第i段所能达到的最大价值,双重循环遇到第i段之前某个段结束时间加上R小于等于第i段的开始时间,则更新dp[i]。
#include<iostream>
#include<algorithm>
using namespace std;
int N,M,R;
struct hah
{
int b;
int e;
int w;
};
bool cmp(hah a,hah b)
{
if(a.e<b.e)
return true;
return false;
}
int main()
{
hah m[1001];
int dp[100001];
cin>>N>>M>>R;
for(int i=0; i<M; i++)
cin>>m[i].b>>m[i].e>>m[i].w;
sort(m,m+M,cmp);//按照结束时间从小到大排序
int res=0;
for( int i=0; i<M; i++)
{
dp[i]=m[i].w;//dp[i]表示从开始取到第i段所能达到的最大数目。
for(int j=0; j<i; j++)//如果第i段之前某个段结束时间加上R小于等于i段的开始时间,则更新dp[i]。
if(m[j].e+R<=m[i].b)
dp[i]=max(dp[i],dp[j]+m[i].w);
res=max(res,dp[i]);
}
cout<<res<<endl;
return 0;
}