原题:HNOI 玩具装箱
方法:1D1D (模板)
program toy;
const
maxn=55000;
var
s,f:array[0..maxn]of int64;
q:array[0..maxn]of record l,r,c:longint; end;
n,len:longint;
procedure init;var i:longint;
begin
readln(n,len);inc(len);
for i:=1 to n do begin
read(s[i]); inc(s[i]); inc(s[i],s[i-1]);
end;
end;
function calc(const i,j:longint):int64;
begin
calc:=sqr(s[i]-s[j]-len)+f[j];
end;
{ procedure main }
var d,t,ll,rr,mid,i:longint;
begin
assign(input,'input.txt');reset(input);
assign(output,'output.txt');rewrite(output);
fillchar(f,sizeof(f),63);init;
d:=1; t:=1; q[1].l:=1; q[1].r:=n; q[1].c:=0; f[0]:=0;
for i:=1 to n do begin
f[i]:=calc(i,q[d].c);
inc(q[d].l); inc(d,ord(q[d].l>q[d].r));
while (d<=t)and(calc(q[t].l,q[t].c)>calc(q[t].l,i)) do dec(t);
if d>t then begin
inc(t); q[t].l:=i+1; q[t].r:=n; q[t].c:=i; continue;
end;
ll:=q[t].l; rr:=q[t].r+1;
while ll+1<rr do begin
mid:=(ll+rr)>>1;
if calc(mid,i)<calc(mid,q[t].c) then rr:=mid else ll:=mid;
end;
if rr=n+1 then continue;
q[t].r:=ll;
inc(t); q[t].l:=rr; q[t].r:=n; q[t].c:=i;
end;
writeln(f[n]);
close(input);close(output);
end.