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 题议大致是:Bessie可以在m个时间段工作,每工作一次都要休息r时间才能继续工作,求在n时间内Bessie能产奶的最大值。 这道题和求最大上升子序列基本一样,所以求法也差不多,dp[x]代表到时间x时所产奶的最大值。#include<stdio.h> #include<algorithm> #include<iostream> #include<memory.h> using namespace std; #define N 1000100 struct node { int x,y,p; }arr[1010]; bool cmp(node a,node b) { if(a.x==b.x) return a.y<b.y; return a.x<b.x; } long long dp[N]; int main() { int n,m,r,i,j; while(cin>>n>>m>>r) { memset(dp,0,sizeof(dp)); for(i=1;i<=m;i++) { scanf("%d%d%d",&arr[i].x,&arr[i].y,&arr[i].p); dp[arr[i].y]=arr[i].p; } sort(arr+1,arr+m+1,cmp); for(i=1;i<=m;i++) { for(j=1;j<i;j++) { if(arr[j].y+r<=arr[i].x) dp[arr[i].y]=max(dp[arr[i].y],dp[arr[j].y]+arr[i].p);//“人人为我”的dp解法 } } long long maxsum=0; for(i=1;i<=m;i++) { maxsum=maxsum>dp[arr[i].y]?maxsum:dp[arr[i].y]; } printf("%I64d\n",maxsum); } return 0; }