const oo=1<<60;var   f,s,q:array[0..50001] of int64;      n,l,i,j,c,h,t:longint;

function min(a,b:int64):int64;beginif a>b then exit(b); exit(a);end;

function slope(j,k:longint):extended;begin            exit((f[j]-f[k]-sqr(s[k]+k)+sqr(s[j]+j))/(s[j]+j-s[k]-k))end;

begin      readln(n,l);for i:=1 to n dobegin            readln(c);            s[i]:=s[i-1]+c;end;

      h:=0; t:=0;for i:=1 to n dobeginwhile (h<t)and(slope(q[h],q[h+1])<(i+s[i]-l-1)*2) do inc(h);            f[i]:=f[q[h]]+sqr(i-q[h]-1+s[i]-s[q[h]]-l);while (h<t)and(slope(q[t-1],q[t])>slope(q[t],i)) do dec(t);            inc(t); q[t]:=i;end;      writeln(f[n]);end.

const oo=2000000000;var   q,num:array[0..1000001] of longint;      f,s:array[0..1000001] of extended;      n,i,h,t:longint;      w,a,b,c:extended;

function slope(j,k:longint):extended;begin            exit((f[j]-f[k]+a*s[j]*s[j]-a*s[k]*s[k]-b*s[j]+b*s[k])/(s[j]-s[k]))end;

begin      readln(n);      readln(a,b,c);

for i:=1 to n dobegin            read(num[i]);            s[i]:=s[i-1]+num[i];end;

      h:=0; t:=0;for i:=1 to n dobeginwhile (h<t)and(slope(q[h],q[h+1])>=2*a*s[i]) do inc(h);            w:=s[i]-s[q[h]];            f[i]:=f[q[h]]+a*w*w+b*w+c;while (h<t)and(slope(q[t-1],q[t])<=slope(q[t],i)) do dec(t);            inc(t); q[t]:=i;end;      writeln(f[n]:0:0);end.

const maxn=20001;var   f,w,d,sw,sd,c,q:array[0..maxn] of longint;      n,i,j,tmp,ans,h,t:longint;

function cost(l,r:longint):longint;begin            cost:=c[r]-c[l-1]-sw[l-1]*(sd[r]-sd[l-1]);end;

function slope(j,k:longint):extended;begin            slope:=(sw[k]*sd[k]-sw[j]*sd[j])/(sw[k]-sw[j]);end;

begin      readln(n);for i:=1 to n do readln(w[i],d[i]);

for i:=1 to n+1 dobegin            sw[i]:=sw[i-1]+w[i];            sd[i]:=sd[i-1]+d[i-1];end;

for i:=1 to n+1 do c[i]:=c[i-1]+sw[i-1]*d[i-1];      h:=1; t:=1; q[1]:=1;for i:=2 to n dobeginwhile (h<t)and(slope(q[h],q[h+1])<sd[i]) do inc(h);            f[i]:=c[q[h]]+cost(q[h]+1,i)+cost(i+1,n+1);while (h<t)and(slope(q[t-1],q[t])>slope(q[t],i)) do dec(t);            inc(t); q[t]:=i;end;      ans:=maxlongint;for i:=2 to n doif ans>f[i] then ans:=f[i];

      writeln(Ans);end.

var   f,tx,fx,st,sf,q:array[0..100001] of longint;      n,s,i,h,t:longint;

function slope(i,j:longint):extended;begin            exit((f[i]-f[j])/(st[i]-st[j]));end;

begin      readln(n);      readln(s);for i:=1 to n do readln(tx[i],fx[i]);for i:=n downto 1 dobegin            st[i]:=st[i+1]+tx[i];            sf[i]:=sf[i+1]+fx[i];end;

      h:=0; t:=0;for i:=n downto 1 dobeginwhile (h<t)and(slope(q[h],q[h+1])<sf[i]) do inc(h);            f[i]:=f[q[h]]+(s+st[i]-st[q[h]])*sf[i];while (h<t)and(slope(q[t-1],q[t])>slope(q[t],i)) do dec(t);            inc(t); q[t]:=i;end;      writeln(f[1]);end.

var   q:array[0..500001] of longint;      f,s,num:array[0..500001] of extended;      dnum,d,i,j,m,n,h,t:longint;

function slope(j,k:longint):extended;var   x,y:extended;begin            y:=f[j]-f[k]-s[j]+s[k]+num[j+1]*j-num[k+1]*k;            x:=num[j+1]-num[k+1];if x=0 thenif y>=0 then exit(k+m)else exit(n+1);            slope:=y/x;if slope<k+m then exit(k+m);end;

begin      readln(dnum);for d:=1 to dnum dobegin            readln(n,m);            fillchar(s,sizeof(s),0);            fillchar(f,sizeof(f),0);for i:=1 to n dobegin                  read(num[i]);                  s[i]:=s[i-1]+num[i];end;            readln;

            h:=0; t:=0;

for i:=m to n dobeginwhile (h<t)and(slope(q[h],q[h+1])<=i) do inc(h);                  f[i]:=f[q[h]]+s[i]-s[q[h]]-num[q[h]+1]*(i-q[h]);while (h<t)and(slope(q[t-1],q[t])>=slope(q[t],i)) do dec(t);                  inc(t); q[t]:=i;end;            writeln(f[n]:0:0);end;end.