poj3616(Milking Time)

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

先对区间左端点从小到大排序，相同时右端点小的在前。然后从前往后依次处理，设dp[i]表示选第i个区间可以获得的最大值，那么对i之前任意与i相距大于等于r的区间j，dp[i]=max(dp[i],dp[j]+s[i].w)

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <map>
#include <vector>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <limits>
#include <new>
#include <utility>
#include <iterator>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <ctime>
using namespace std;struct milk
{int x, y, w;bool operator < (const milk& b) const{if (x == b.x)return y < b.y;return x < b.x;}
};int main()
{int n, m, r, dp[1005];milk s[1005];cin >> n >> m >> r;for (int i = 0; i < m; ++i)scanf("%d%d%d", &s[i].x, &s[i].y, &s[i].w);sort(s, s+m);for (int i = 0; i < m; ++i)dp[i] = s[i].w;int ans = 0;for (int i = 0; i < m; ++i){for (int j = 0; j < i; ++j)if (s[i].x >= s[j].y + r)dp[i] = max(dp[i], dp[j]+s[i].w);ans = max(ans, dp[i]);}printf("%d\n", ans);return 0;
}

poj3616(Milking Time)相关推荐

kuangbin专题十二基础DP
kuangbin专题十二基础DP A - HDU1024 Max Sum Plus Plus B - HDU1029 Ignatius and the Princess IV C - HDU1069 ...
Milking Time（POJ-3616）
Problem Description Bessie is such a hard-working cow. In fact, she is so focused on maximizing her ...
Milking Cows 挤牛奶
1.2.1 Milking Cows 挤牛奶 Time Limit: 1 Sec Memory Limit: 64 MB Submit: 554 Solved: 108 [Submit][Stat ...
POJ 2112 Optimal Milking（二分+最大流）
POJ 2112 Optimal Milking 题目链接题意:给定一些机器和奶牛,在给定距离矩阵,(不在对角线上为0的值代表不可达),每一个机器能容纳m个奶牛.问全部奶牛都能挤上奶,那么走的距离最 ...
1642: [Usaco2007 Nov]Milking Time 挤奶时间(dp)
1642: [Usaco2007 Nov]Milking Time 挤奶时间 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 935 Solved: 5 ...
J - Milking Time POJ - 3616（dp动态规划）
Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that sh ...
动态规划训练22 [Milking Time POJ - 3616 ]
Milking Time POJ - 3616 说实话这道题目非常简单,本质上就是多段有向图的求最大值问题.稍微变化的地方在于这个的的有向边没有那么明显 ,而是需要自己去寻找如果任务i到任务j之间 ...
【POJ - 3616】Milking Time （贪心+dp）
题干: Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity tha ...
dp打开思路3：HDU1069 POJ3616 POJ1088
HDU 1069 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1069 题意:把给定的长方体(不限)叠加在一起,叠加的条件是,上面一个长方体的长和宽都 ...
Milking Time【动态规划-dp】
Milking Time POJ - 3616 Bessie is such a hard-working cow. In fact, she is so focused on maximizing ...

poj3616(Milking Time)

poj3616(Milking Time)相关推荐

最新文章

热门文章