Milking Time

Time Limit: 1000MS Memory Limit: 65536K

Total Submissions: 9459 Accepted: 3935

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

Sample Output

Source

USACO 2007 November Silver

有将近一个月没做题，练一下手感。

 //2017-05-16

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 const int M = ;

 int dp[M];

 struct Milk

 {

     int bg, ed, eff;

     bool operator<(Milk x) const{

         return ed < x.ed;

     }

 }milk[M];

 int main()

 {

     int n, m, r;

     while(scanf("%d%d%d", &n, &m, &r)!=EOF)

     {

         memset(dp, , sizeof(dp));

         for(int i = ; i < m; i++){

             scanf("%d%d%d", &milk[i].bg, &milk[i].ed, &milk[i].eff);

         }

         sort(milk, milk+m);

         int ans = ;

         for(int i = ; i < m; i++){

             if(milk[i].ed > n)break;

             dp[i] = milk[i].eff;

             for(int j = ; j < i; j++){

                 if(milk[i].bg-r >= milk[j].ed){

                     dp[i] = max(dp[i], dp[j]+milk[i].eff);//dp[i]表示到第i个区间的最大值

                 }else break;

             }

             if(dp[i] > ans)ans = dp[i];

         }

         printf("%d\n", ans);

     }

     return ;

 }

巴特西

POJ3616(KB12-R dp)