poj 3616 Milking Time

                                                                             Milking Time

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12350		Accepted: 5235

Description

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

* 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_hour_i , ending_hour_i , and efficiency_i

Output

* Line 1: The maximum number of gallons of milk that Bessie can product in the N hours

Sample Input

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

Sample Output

43

//题意：输入三个数N，M, R； R：表示1到N小时是给你的可用时间;

//M:表示给你M个可以挤牛奶时间区间,每一个区间由三个数表示,starting_hour_i:开始时间；ending_hour_i:结束时间; efficiency_{i:这段时间的挤奶量;}

_{//R:表示每段挤奶时间后你都要休息R小时，才能进入下一次挤奶时间区间; 问你在N小时内最多能挤多少奶？}

//理解：又是个递增子序列问题，不过不是求最长，而是求最大（最长不一定最大）。

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

typedef long long LL;
const int maxn = 1010;
LL ans = 0;  //输出的结果;
LL dp[maxn];  //dp[i]表示第i个时间区间必须使用后产生的最大值;
struct interval{
    int s, e, v;
}a[maxn];

bool cmp(interval x, interval y){
    if(x.s != y.s)
        return x.s < y.s;
    else if(x.e != y.e)
        return x.e < y.e;
}

int main(){
    int n, m, r;
    while(~scanf("%d%d%d", &n, &m, &r)){
        ans = 0;
        for(int i = 0; i < m; i++){
            scanf("%d%d%d", &a[i].s, &a[i].e, &a[i].v);
        }
        sort(a, a+m, cmp);
        dp[0] = a[0].v;  //初始化;
        for(int i = 1; i < m; i++){
            dp[i] = a[i].v;
            for(int j = 0; j < i; j++){ //这个for循环是用来更新dp[i]的
                if(a[j].e+r <= a[i].s){  //如果当前的第j个区间可以放在i前面,则看看能不能更新dp[i];
                    dp[i] = max(dp[i], dp[j]+a[i].v);
                }
            }
            ans = max(dp[i], ans); //对于已确定的dp[i]，我们找出它的最大值;
        }
        cout << ans << endl;
    }
    return 0;
}