题目概述
有
n
个士兵,战斗力为
解题报告
加了个二次函数强制把裸的线性DP搞成了斜率优化……
由于这道题是求 max ,所以把斜率递增搞成斜率递减就可以了。
打斜率优化题目就是容易打错符号,符号惨案啊QAQ。
解题报告
#include<cstdio>
using namespace std;
const int maxn=1e6;
typedef long long LL;
int n,A,B,C;LL sum[maxn+5],f[maxn+5];
int Head,Tail,que[maxn+5];
#define Eoln(x) ((x)==10||(x)==13||(x)==EOF)
inline char readc()
{
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF; else return *l++;
}
inline int readi(int &x)
{
int tot=0,f=1;char ch=readc(),lst='+';
while ('9'<ch||ch<'0') {if (ch==EOF) return EOF;lst=ch;ch=readc();}
if (lst=='-') f=-f;
while ('0'<=ch&&ch<='9') tot=(tot<<3)+(tot<<1)+ch-48,ch=readc();
return x=tot*f,Eoln(ch);
}
#define sqr(x) ((x)*(x))
#define X(i,j) (sum[j]-sum[i])
#define Y(i,j) (f[j]+sqr(sum[j])*A-sum[j]*B-f[i]-sqr(sum[i])*A+sum[i]*B)
int main()
{
freopen("program.in","r",stdin);
freopen("program.out","w",stdout);
readi(n);readi(A);readi(B);readi(C);
for (int i=1,x;i<=n;i++) readi(x),sum[i]=sum[i-1]+x;
f[0]=0;Head=1;que[Tail=1]=0;
for (int i=1;i<=n;i++)
{
while (Head<Tail&&Y(que[Head],que[Head+1])>=X(que[Head],que[Head+1])*sum[i]*A*2) Head++;
f[i]=f[que[Head]]+sqr(X(que[Head],i))*A+X(que[Head],i)*B+C;
while (Head<Tail&&Y(que[Tail-1],que[Tail])*X(que[Tail],i)<=Y(que[Tail],i)*X(que[Tail-1],que[Tail])) Tail--;
que[++Tail]=i;
}
return printf("%lld\n",f[n]),0;
}