链接
题解
看完数据规模就觉得这题肯定卡 l o g log log
d p i j dp_{ij} dpij表示放第 i i i个はなび时候我在第 j j j个位置此时开心值的最大值
那么 d p i j = b i − ∣ a i − j ∣ + m a x ( d p i − 1 , k ) dp_{ij} = b_i - |a_i-j| + max(dp{i-1,k}) dpij=bi−∣ai−j∣+max(dpi−1,k),其中 j − d Δ t ≤ k ≤ j + d Δ t j-d\Delta t \leq k \leq j+d\Delta t j−dΔt≤k≤j+dΔt
单调队列搞一搞完事
代码
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll n, m, d, a[maxn], b[maxn], t[maxn], dp[2][maxn];
deque<ll> q;
int main()
{
ll i, j, k;
n=read(), m=read(), d=read();
rep(i,m)a[i]=read(), b[i]=read(), t[i]=read();
t[0]=1;
rep(i,m)
{
auto &f=dp[i&1^1], &g=dp[i&1];
ll l=(t[i]-t[i-1])*d;
k=1;
q.clear();
rep(j,n) //g[j]=b[i]-abs(a[i]-j)+max(f[k]) [j-l<=k<=j+l]
{
while(k<=j+l and k<=n)
{
while(!q.empty() and f[q.back()]<f[k])q.pop_back();
q.emb(k);
k++;
}
while(q.front()<j-l)q.pop_front();
g[j] = b[i]-abs(a[i]-j) + f[q.front()];
}
}
ll mx=-linf;
rep(i,n)mx=max(mx,dp[m&1][i]);
printf("%lld",mx);
return 0;
}