POJ 3616 Milking Time

题意

给m只奶牛挤奶，挤奶时间必须处于[1, n]；
给出每次开始挤奶的时间st,结束挤奶的时间ed,还有挤奶的量ef;
每次挤完奶要休息r时间;
问: 最大挤奶量为？

题解

[线性DP--LIS模型]
分析：
    题意就等效于找一段满足条件的挤奶序列，使得挤奶量最多
    故而，只需要将原序列按照时间序递增的排序，
    在利用求LIS的思路即可

Code

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define read(a) scanf("%d", &a)
#define readf(a) scanf("%lf", &a)
#define pb push_back
#define mk make_pair
#define _rand mt19937 RAND(time(0))
#define mem(a) memset(a, 0, sizeof(a))
#define Buff ios::sync_with_stdio(false)
typedef long long ll;
using namespace std;
const int INF = 1e9 + 7;
const int N = 2e5 + 7;
const int M = 1e6 + 7;
struct node
{
    int st, ed, val;
    bool operator<(const node& A)const{
        return st < A.st || (st == A.st && ed < A.ed);
    }
}a[N];
int dp[N];
signed main()
{
    Buff;
    int n, m, R;
    while(cin >> n >> m >> R)
    {
        for(int i = 1; i <= m; i++)
            cin >> a[i].st >> a[i].ed >> a[i].val;
        sort(a + 1, a + m + 1);
        int ans = 0;
        for(int i = 1; i <= m; i++)
        {
            if(a[i].st > n || a[i].ed > n) continue;
            dp[i] = a[i].val;
            for(int j = 1; j < i; j++)
                if(a[j].ed + R <= a[i].st && dp[j] + a[i].val > dp[i])  dp[i] = dp[j] + a[i].val;
            if(dp[i] > ans) ans = dp[i];
        }
        cout << ans << "\n";
    }
    return 0;
}