有 n 个题目,每个题目有一个难度,保证递增,还有一个花费, 你每出一道题会获得 a 元回报,现在需要你选择一个连续区间,使得受益最大,同时,收益还要减去 gap(i, j ) gap ( i , j ) = max( d[i] - di+1] ) ^2 求最大收益
枚举 gap 出现点,用线段树维护区间最大和。。。同时需要注意,维护的区间和是连续区间和,需要前缀和后缀
线段树同时维护前缀最大值和后缀最大值。。。。,同时单调栈用 O( N ) 解决边界问题
想得到,但是码力不足。。。
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ls rt<<1,l,mid
#define rs rt<<1|1,mid+1,r
const int maxn = 3e5 + 10;
struct tree
{
ll sum, rmx, lmx, mx;
}sgt[maxn<<2];
int c[maxn],d[maxn],diff[maxn],a,n;
ll l[maxn],r[maxn];
ll ans;
inline void pushup(int rt)
{
sgt[rt].sum = sgt[rt<<1].sum + sgt[rt<<1|1].sum;
sgt[rt].mx = max(sgt[rt<<1].mx, sgt[rt<<1|1].mx);
sgt[rt].lmx = max(sgt[rt<<1].lmx, sgt[rt<<1].sum + sgt[rt<<1|1].lmx);
sgt[rt].rmx = max(sgt[rt<<1|1].rmx, sgt[rt<<1|1].sum + sgt[rt<<1].rmx);
sgt[rt].mx = max(sgt[rt].mx, sgt[rt<<1].rmx + sgt[rt<<1|1].lmx);
}
inline void build(int rt, int l, int r)
{
if(l == r)
{
sgt[rt].sum = sgt[rt].lmx = sgt[rt].rmx = sgt[rt].mx = c[l];
return;
}
int mid = l + r >> 1;
build(ls); build(rs);
pushup(rt);
}
inline tree query(int rt, int l, int r, int L, int R)
{
if(L<=l && r<=R) return sgt[rt];
int mid = (l+r)>>1;
if(R <= mid) return query(ls, L, R);
if(L > mid) return query(rs, L, R);
tree tl = query(ls, L, R), tr = query(rs, L, R), t;
t.sum = tl.sum + tr.sum;
t.mx = max(tl.mx, tr.mx);
t.mx = max(t.mx, tl.rmx + tr.lmx);
t.lmx = max(tl.lmx, tl.sum + tr.lmx);
t.rmx = max(tr.rmx, tr.sum + tl.rmx);
return t;
}
struct node
{
int val, id;
};
int main()
{
scanf("%d%d",&n,&a);
for(int i=1;i<=n;i++)
{
scanf("%d%d", &d[i], &c[i]);
c[i] = a - c[i];
ans = max(ans, 1LL * c[i]);
}
for(int i=1;i<n;i++)
diff[i] = d[i+1]-d[i];
build(1, 1, n);
stack<node>stk;
stk.push({(int)1e9, 0});
for(int i=1;i<n;i++)
{
while(stk.top().val<=diff[i])stk.pop();
l[i] = stk.top().id + 1;
stk.push({diff[i], i});
}
while(stk.size())stk.pop();
stk.push({(int)1e9, n});
for(int i=n-1;i;i--)
{
while(stk.top().val<=diff[i])stk.pop();
r[i] = stk.top().id;
stk.push({diff[i], i});
}
for(int i=1;i<n;i++)
ans = max(ans, query(1, 1, n, l[i], r[i]).mx - 1LL * diff[i] * diff[i]);
printf("%lld\n", ans);
return 0;
}