POJ3616 milking time 首次做没注意TLE了- -

Milking Time

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4057		Accepted: 1696

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 Nhours.

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

破题：题目还算好理解，奶牛从时刻1起计时到时刻n（1~1000000）.在这段时间内，奶农有m（1~1000）个区间可以挤奶，每个区间都有个挤奶量efficiency(1~1000000),还有两个时间点即起始与结束
思考：（1）建模第一步是想想到底是一位数组还是二维数组甚至三维这里明显应该是一维的
（2）第二步开始写出递推关系式，以及找出目标函数还有状态函数，以及自变量。想都不想就找了时间作为自变量（所以范围就是1~1000000...）。
dp[i]表示在时间i时的最大挤奶量，决策点取在i等于某个区间的结束点时,因为此时需要进行选择比较
TLE原因：
没有具体细心分析所给数据范围，本算法的时间复杂度是O（n*m+m）= =....不TLE才怪- -魂淡速度给我去重写！！！！！！！！！！！！！