Problem 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_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 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小時后才能再次工作，其后分別給出這m段時間內每段的開始時間、結束時間、工作量，求最大工作量。

思路：將m段時間段按照他們的結束時間升序排序，用f[i]表示取到第i段時間時的最大值，如果第i個時間段之前的一個時間段的結束時間加上r小于第i段的開始時間，更新最大值。

即：if(time[i].start>=time[j].end+r)

?????????f[i]=max(f[i],f[j]+time[i].value);

Source Program

#include<iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<string> #include<cstdlib> #include<queue> #include<vector> #define INF 0x3f3f3f3f #define PI acos(-1.0) #define N 100001 #define MOD 1001 #define E 1e-12 using namespace std; int f[N]; struct Node{int start;int endd;int value; }time[N]; bool cmp(Node a,Node b) {return a.endd<b.endd;} int main() {int n,m,r;scanf("%d%d%d",&n,&m,&r);for(int i=1;i<=m;i++)scanf("%d%d%d",&time[i].start,&time[i].endd,&time[i].value);sort(time+1,time+m+1,cmp);//按結束時間升序排序int maxx=-INF;time[0].endd=-r;for(int i=1;i<=m;i++){for(int j=0;j<i;j++)if(time[i].start>=time[j].endd+r)//如果第i個時間段之前的一個時間段的結束時間加上r小于第i段的開始時間f[i]=max(f[i],f[j]+time[i].value);//更新最大值maxx=max(maxx,f[i]);}printf("%d\n",maxx); }

?

總結

以上是生活随笔為你收集整理的Milking Time（POJ-3616）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。