特别行动队

$d{p}_i=d{p}_j+sum{t}_i\ast (sum{f}_i-sum{f}_j)+s\ast (sum{f}_n-sum{f}_j)$
$d{p}_i=d{p}_j+sum{t}_i\ast sum{f}_i-sum{t}_i\ast sum{f}_j+s\ast sum{f}_n-s\ast sum{f}_j$
$d{p}_i-sum{t}_i\ast sum{f}_i-s\ast sum{f}_n+sum{t}_i\ast sum{f}_j+s\ast sum{f}_j=d{p}_j$

$d{p}_i-sum{t}_i\ast sum{f}_i-s\ast sum{f}_n+(sum{t}_i+s)\ast sum{f}_j=d{p}_j$

$d{p}_i-sum{t}_i\ast sum{f}_i-s\ast sum{f}_n=b$
$(sum{t}_i+s)=k$
$sum{f}_j=x$
$d{p}_j=y$

$(sum[i],dp[i])$

$\mathbf{k}=\frac{\mathbf{d}{\mathbf{p}}_{\mathbf{j}}-\mathbf{d}{\mathbf{p}}_{\mathbf{i}}}{\mathbf{sum}{\mathbf{f}}_{\mathbf{j}}-\mathbf{sum}{\mathbf{f}}_{\mathbf{i}}}$
维护前面的是不是需要,直接单调队列维护凸包就好了

#include<bits/stdc++.h>
#define I inline 
#define LL long long 
#define RI register int 
#define inf 0x3f3f3f3f
#define debug puts("debug")
#define o(x) cout<<x<<' '
#define O(x) cout<<x<<endl
#define ls(x) x<<1
#define rs(x) x<<1|1
#define N 1000100
#define Mod 998244353
using namespace std;
I int read()
{
	RI res=0,f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f=-f;ch=getchar();}
	while(isdigit(ch))res=(res<<1)+(res<<3)+(ch&15),ch=getchar();
	return res*f;
}
LL n,sum[N],a,b,c,x[N],f[N],q[N];
LL num[N]; 
int head=1,tail=1;
int main()
{
	n=read();a=read();b=read();c=read();
	for(RI i=1;i<=n;i++)x[i]=read(),sum[i]=sum[i-1]+x[i],num[i]=a*sum[i]*sum[i]-b*sum[i];
	for(RI i=1;i<=n;i++){
		while(head < tail && 
		( f[q[head+1]]-
		f[q[head]] + 
		num[q[head+1]] - 
		num[q[head]]) 
		>= 
		((sum[q[head+1]]-
		sum[q[head]])*2*a*sum[i]) 
		)head++;
		
		
	f[i]=
		f[q[head]]+
		num[q[head]]-
		2*a*sum[i]*
		sum[q[head]]+
		a*sum[i]*sum[i]+
		b*sum[i]+c;
		
		while(head < tail &&  (f[i] - f[q[tail]] + num[i] - num[q[tail]])*(sum[q[tail]]-sum[q[tail-1]]) 
		>= (f[q[tail]] - f[q[tail-1]] + num[q[tail]] - num[q[tail-1]])*(sum[i]-sum[q[tail]]) )

		tail--;q[++tail]=i; 
	
	}
	printf("%lld",f[n]);return 0;
}