https://www.lydsy.com/JudgeOnline/problem.php?id=1911
一维斜率优化大概都是这种形式。。。设dp[i]为前i个分组的最大值
dp[i]=dp[k]+a(sum[i]-sum[k])^2+b(sum[i]-sum[k])+c
-asum[k]^2+bsum[k]-dp[k]= -2asum[i]sum[k] +asum[i]^2+bsum[i]-dp[i]
然后把-asum[k]^2+bsum[k]-dp[k]当y,-2asum[i]当斜率,sum[k]当x,asum[i]^2+bsum[i]-dp[i]当截距。
x是不断增大的,y不知道,斜率是递增的,我们希望dp[i]最大,那么希望截距最小,通过画图可知,用单调队列维护一个上凸包
#include<bits/stdc++.h>
using namespace std;
const int maxl=1e6+10;
typedef long long ll;
int n;
ll a,b,c;
ll sum[maxl],dp[maxl];
struct node
{
ll x,y;
}s[maxl];
inline void prework()
{
scanf("%d",&n);
scanf("%lld%lld%lld",&a,&b,&c);
for(int i=1;i<=n;i++)
scanf("%lld",&sum[i]),sum[i]+=sum[i-1];
}
inline ll calc(ll k,int id)
{
return s[id].y-k*s[id].x;
}
inline bool cmpk(node a,node b,node c)
{
return 1.0*(b.y-a.y)*(c.x-b.x)>=1.0*(c.y-b.y)*(b.x-a.x);
}
inline void mainwork()
{
int head=1,tail=0;
node d=node{0,0};
s[++tail]=d;
for(int i=1;i<=n;i++)
{
while(head<tail && calc(-2*a*sum[i],head)>=calc(-2*a*sum[i],head+1))
head++;
dp[i]=a*sum[i]*sum[i]+b*sum[i]+c-calc(-2*a*sum[i],head);
d=node{sum[i],-a*sum[i]*sum[i]+b*sum[i]-dp[i]};
while(head<tail && cmpk(s[tail-1],s[tail],d))
tail--;
s[++tail]=d;
}
}
inline void print()
{
printf("%lld",dp[n]);
}
int main()
{
prework();
mainwork();
print();
return 0;
}