【DP】【斜率优化】【单调队列优化】Gift 题解

给出起点终点，给出m个点，每个点可以延伸l的区间，每个单位得分为w，求最大得分。

Dp[i][j]表示前i个人装饰前j个单位能得到的最大得分
易得出朴素方程
Dp[i][j]=max(dp[i-1][k]+(j-k)*w);(k+1<=原始位置<=j)
之后随便斜率或者单调队列优化。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <stack>
#define INF 2147483647
#define LL long long
#define clr(x) memset(x, 0, sizeof x)
#define digit (ch <  '0' || ch >  '9')

using namespace std;

template <class T> inline void read(T &x) {
    int flag = 1; x = 0;
    register char ch = getchar();
    while( digit) { if(ch == '-')  flag = -1; ch = getchar(); }
    while(!digit) { x = (x<<1)+(x<<3)+ch-'0'; ch = getchar(); }
    x *= flag;
}

const int maxn = 100005;
struct data {
    int l,s,p;
    inline bool operator < (const data &x) const { return s < x.s; }
} a[maxn];
int n,m,head,tail;
int q[maxn],dp[maxn][105];

int main() {
    freopen("gift.in","r",stdin);
    freopen("gift.out","w",stdout);
    read(n); read(m);
    for(register int i = 1; i <= m; i++) read(a[i].l), read(a[i].p), read(a[i].s);
    sort(a+1, a+m+1);
    for(register int i = 1; i <= m; i++){
        head = tail = 0; clr(q);
        for(register int j = 1; j <= n; j++) dp[i][j] = dp[i-1][j];
        for(register int j = max(0, a[i].s-a[i].l); j < a[i].s; j++) {
            while(tail > head && dp[i-1][q[tail-1]]-a[i].p*q[tail-1] < dp[i-1][j]-a[i].p*j) tail--;
            q[tail++] = j;
        }
        for(register int j = a[i].s; j <= min(a[i].s+a[i].l-1, n); j++) {
            while(q[head] < j-a[i].l && head < tail) head++;
            dp[i][j] = max(dp[i][j], dp[i][j-1]);
            dp[i][j] = max(dp[i][j], dp[i-1][q[head]]+a[i].p*(j-q[head]));
        }
        for(register int j = a[i].s+a[i].l; j <= n; j++) dp[i][j] = max(dp[i][j],dp[i][j-1]);
    }
    cout << dp[m][n] << endl;
    return 0;
}