[DP] Tsin A1315 积木

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(ll &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}


const int N=1000005;

int n; ll Cost;
ll h[N],s1[N],s2[N];

int p,sta[N];
ll f[N],g[N],ans;

struct Func{
  ll A,B,C,l,r;
  Func(ll A,ll B,ll C,ll l,ll r):A(A),B(B),C(C),l(l),r(r) { }
  ll f(ll x){
    x=max(min(x,r),l);
    return A*x*x+B*x+C;
  }
  ll Min(){
    ll x=-B/(2*A);
    return min(f(x),f(x+1));
  }
};

inline void modify(int i,int j,ll *f){
  if (i+1==j) return void(f[j]=min(f[j],f[i]+(i?Cost*abs(h[i]-h[j]):0))); 
  ll ret=Func(j-i-1,
          -2*(s1[j-1]-s1[i]+Cost)+(!i)*Cost,
          s2[j-1]-s2[i]+Cost*(h[i]+h[j])-(!i)*Cost*h[i],
          h[sta[p+1]],
          min(h[i],h[j])).Min();
  f[j]=min(f[j],f[i]+ret);
}

inline void dp(ll *f){
  for (int i=1;i<=n;i++) s1[i]=s1[i-1]+h[i],s2[i]=s2[i-1]+h[i]*h[i];
  p=0;
  for (int i=1;i<=n;i++){
    f[i]=1LL<<60;
    while (p && h[sta[p]]<=h[i])
      modify(sta[p],i,f),p--;
    modify(sta[p],i,f);
    sta[++p]=i;
  }
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(Cost);
  for (int i=1;i<=n;i++) read(h[i]);
  h[0]=1000000;
  dp(f); reverse(h+1,h+n+1); dp(g);
  ans=1LL<<60;
  for (int i=1;i<=n;i++)
    ans=min(ans,f[i]+g[n-i+1]);
  printf("%lld\n",ans);
  return 0;
}