#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
 
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
 
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
 
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
 
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
  for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
 
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const int MOD = 1000000007;

struct UnionFind {
  vector<int> par, s;
  UnionFind(int n=2e5) { init(n); }
  void init(int n) { 
    s.assign(n, 1); par.resize(n); 
    iota(par.begin(), par.end(), 0);
  }
  int find(int x) {
    if(par[x] == x) return x;
    return par[x] = find(par[x]);
  }
  void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if(x == y) return;
    if(s[x] < s[y]) par[x] = y, s[y] = s[x] + s[y];
    else par[y] = x, s[x] = s[x] + s[y];
  }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return s[find(x)]; }
};

template< typename T, typename F >
T boruvka(ll n, F f) {
  vector<ll> rev(n), belong(n);
  UnionFind uf(n);
  T ret = T();
  while(uf.size(0) != n) {
    ll ptr = 0;
    REP(i, n) {
      if(uf.find(i) == i) {
        belong[i] = ptr++;
        rev[belong[i]] = i;
      }
    }
    REP(i, n) belong[i] = belong[uf.find(i)];
    auto v = f(ptr, belong);
    bool update = false;
    REP(i, ptr) {
      if(~v[i].second && !uf.same(rev[i], rev[v[i].second])) {
        uf.unite(rev[i], rev[v[i].second]);
        ret += v[i].first;
        update = true;
      }
    }
    if(!update) return -1; // notice!!
  }
  return ret;
}

template <typename T>
struct segtree {
  int n;
  vector<T> dat;
  T d;
  using F = function<T(T,T)>;
  F f, g;

  segtree(int n_, F f_, F g_, T d_) : f(f_), g(g_), d(d_) {
    n = 1;
    while(n < n_) n *= 2;
    dat.assign(n*2, d); 
  }
  // [a, b)
  T query(int a, int b, int k, int l, int r) {
    if(r <= a || b <= l) return d;
    if(a <= l && r <= b) return dat[k];
    return f(query(a, b, 2*k+1, l, (l+r)/2),
             query(a, b, 2*k+2, (l+r)/2, r));
  }
  T query(int a, int b) {return query(a, b, 0, 0, n);}
  void update(int i, T v) {
    i += n-1;
    dat[i] = g(dat[i], v);
    while(i > 0) {
      i = (i-1)/2;
      dat[i] = f(dat[i*2+1], dat[i*2+2]);
    }
  }
};
/**
* 点更新区間min d=INF, f=min(a,b), g=b\n
* 点更新区間max d=-INF, f=max(a,b), g=b\n
* 点加算区間和  d=0, f=a+b, g+=b
*/

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, d;
  cin >> n >> d;
  vector<ll> a(n);
  REP(i, n) cin >> a[i];

  // 区間最小のセグ木
  auto f1 = [](PII a, PII b) { return min(a, b); };
  auto f2 = [](PII a, PII b) { return b; };
  segtree<PII> seg1(n, f1, f2, make_pair(LLINF,LLINF)),
               seg2(n, f1, f2, make_pair(LLINF,LLINF));
  REP(i, n) {
    seg1.update(i, {a[i]-i*d, i});
    seg2.update(i, {a[i]+i*d, i});
  }

  // 各頂点から最小のコストの辺を求める 
  // f(連結成分数、i番目の頂点が属する連結成分)
  function<vector<PII>(ll,vector<ll>)> f = [&](ll sz, vector<ll> belong) {
    // ret[i] = (頂点iからコスト最小の辺の(コスト, i以外の端点))
    // iがufの親以外ならsecondは-1として連結成分ごとに管理
    vector<PII> ret(sz, PII(LLINF, -1));
    // 連結成分ごとにまとめる
    ll m = 0;
    REP(i, n) chmax(m, belong[i]);
    vector<vector<ll>> member(m+1);
    REP(i, n) member[belong[i]].push_back(i);
    for(auto v: member) {
      vector<PII> rec1, rec2;
      for(auto i: v) {
        rec1.push_back(seg1.query(i, i+1));
        seg1.update(i, make_pair(LLINF, LLINF));
        rec2.push_back(seg2.query(i, i+1));
        seg2.update(i, make_pair(LLINF, LLINF));
      }
      for(auto i: v) {
        auto vl = seg1.query(0, i); vl.first += a[i] + i*d;
        auto vr = seg2.query(i+1, n); vr.first += a[i] - i*d;
        chmin(ret[belong[i]], min(vl, vr)); 
      }
      REP(i, v.size()) {
        seg1.update(v[i], rec1[i]);
        seg2.update(v[i], rec2[i]);
      }
    }
    return ret;
  };

  cout << boruvka<ll, decltype(f)>(n, f) << endl;

  return 0;
}
