#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;

template <typename T>
class segtree {
public:
  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
*/

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)]; }
};

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

  ll n, d;
  cin >> n >> d;
  vector<PII> a(n);
  REP(i, n) cin >> a[i].first, a[i].second = i;

  vector<ll> x, y, z;

  auto func = [&]() {
    auto f = [](PII a, PII b) { return min(a, b); };
    auto g = [](PII a, PII b) { return b; };
    segtree<PII> seg1(n, f, g, PII(LLINF, 0)), 
                 seg2(n, f, g, PII(LLINF, 0));

    vector<PII> b(a);
    sort(ALL(b));
    vector<ll> p(n), q(n);
    REP(i, n) {
      p[i] = b[i].first + d*b[i].second;
      q[i] = b[i].first + d*b[i].second;
    }

    REP(i, n) {
      ll t1 = b[i].first - d*b[i].second;
      auto ret = seg1.query(b[i].second, n);
      if(ret.first != LLINF) {
        x.push_back(b[i].second);
        y.push_back(ret.second);
        z.push_back(ret.first + t1);
      }
      ll t2 = b[i].first + d*b[i].second;
      ret = seg2.query(0, b[i].second);
      if(ret.first != LLINF) {
        x.push_back(b[i].second);
        y.push_back(ret.second);
        z.push_back(ret.first + t2);
      }
      seg1.update(b[i].second, PII(t2, b[i].second));
      seg2.update(b[i].second, PII(t1, b[i].second));
    }
  };

  func();

  // Kruskal
  ll m = x.size(), ret = 0;
  UnionFind uf(n);
  vector<ll> idx(m);
  iota(ALL(idx), 0);
  sort(ALL(idx), [&](ll l, ll r){
    return z[l] < z[r];
  });
  REP(i, m) {
    if(uf.same(x[idx[i]], y[idx[i]])) continue;
    uf.unite(x[idx[i]], y[idx[i]]);
    ret += z[idx[i]];
  }
  cout << ret << endl;
}


Measured memory_bytes: 40524