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_hour_i ≤ N), an ending hour (starting_hour_i < ending_hour_i ≤ N), and a corresponding efficiency (1 ≤ efficiency_i ≤ 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

Output

Sample Input

12 4 2
1 2 8
10 12 19
3 6 24
7 10 31

Sample Output

43

题解：排完序，状态就比较明显了，dp[ i ]表示第i个时间段能得到的最大牛奶数。
因此 dp[ i ]=dp[ j ]+no[ i ](1<=j<i且满足条件After being milked during any interval, 
she must rest R (1 ≤ R ≤ N) hours before she can start milking again)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn=1005;

struct node{
    int l,r,sum;
    bool operator<(const node& i)const{
        return l < i.l;
    }
}co[maxn];

int n,m,re;
int dp[maxn];

void solve()
{   int ans=0;
    for(int i=1;i<=m;i++){
        dp[i]=co[i].sum;
        for(int j=1;j<i;j++) if(co[i].l>=co[j].r+re) dp[i]=max(dp[i],dp[j]+co[i].sum);    
        ans=max(ans,dp[i]);
    }
    cout<<ans<<endl;
}

Milking Time POJ - 3616