#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;


vector<ll> uft;

ll parent(ll a){
    if(uft[a]==a){return a;}
    return uft[a]=parent(uft[a]);
}

void merge(ll a,ll b){
    uft[parent(a)]=parent(b);
}

//0-index
template<typename T,typename U> //T::要素,U::作用素
class late_seg_tree{
private:
    typedef pair<T,U> node;
    vector<vector<node>> tree;
    ll high;
    T err_T;
    U err_U;
    ll err;
    
    T F(T,T); //要素のマージ (要素,要素)
    T G(T,U,ll); //作用素->要素 (要素,作用素,場所)
    U H(U,U); //作用素のマージ (作用素,作用素)
    T I(T,U,ll,ll); //作用素->区間要素 (要素,作用素,l,r) [l,r)
    
    ll bit_size(ll a){
        for(int i=1;i<63;i++){
            if(1<<i >= a){return i;}
        }
        return err;
    }
    
    //[l,r)
    void update(ll h,ll where,ll l,ll r,U u){
        ll L=where<<(high-h-1);
        ll R=(where+1)<<(high-h-1);
        if(r<=L || R<=l){return;}
        if(h==high-1){tree[h][where].F=G(tree[h][where].F,u,where); return;}
        if(l<=L && R<=r){
            tree[h][where].S=H(tree[h][where].S,u);
            tree[h][where].F=F(tree[h+1][where*2].F,tree[h+1][where*2+1].F);
            tree[h][where].F=I(tree[h][where].F,tree[h][where].S,L,R);
        }
        else{
            update(h+1,where*2,l,r,u);
            update(h+1,where*2+1,l,r,u);
            tree[h][where].F=F(tree[h+1][where*2].F,tree[h+1][where*2+1].F);
            tree[h][where].F=I(tree[h][where].F,tree[h][where].S,L,R);
        }
    }
    
    T search(ll h,ll where,ll l,ll r){
        ll L=where<<(high-h-1);
        ll R=(where+1)<<(high-h-1);
        if(r<=L || R<=l){return err_T;}
        if(h==high-1){return tree[h][where].F;}
        if(l<=L && R<=r){return tree[h][where].F;}
        else{
            update(h+1,where*2,L,R,tree[h][where].S);
            update(h+1,where*2+1,L,R,tree[h][where].S);
            tree[h][where].S=err_U;
            T ret=err_T;
            ret=F(ret,search(h+1,where*2,l,r));
            ret=F(ret,search(h+1,where*2+1,l,r));
            return ret;
        }
        return err_T;
    }
    
public:
    late_seg_tree(ull size,T err_T,U err_U):err_T(err_T),err_U(err_U){
        err=1e18+7;
        high=bit_size(size)+1;
        tree.resize(high);
        for(int i=0;i<high;i++){
            tree[i].resize(1<<i,{err_T,err_U});
        }
    }
    
    late_seg_tree(vector<T> t,T err_T,U err_U):err_T(err_T),err_U(err_U){
        err=1e18+7;
        high=bit_size(t.size())+1;
        tree.resize(high);
        for(int i=0;i<high;i++){
            tree[i].resize(1<<i,{err_T,err_U});
        }
        for(int i=0;i<t.size();i++){
            tree[high-1][i]={t[i],err_U};
        }
        for(ll h=high-2;h>=0;h--){
            for(int i=0;i<tree[h].size();i++){
                tree[h][i].F=F(tree[h+1][i*2].F,tree[h+1][i*2+1].F);
            }
        }
    }
    
    void update(ll l,ll r,U u){
        update(0,0,l,r,u);
    }
    
    T search(ll l,ll r){
        return search(0,0,l,r);
    }
};


int main(){
    ll n,d;
    cin>>n>>d;
    vector<pll> a(n);
    uft.resize(n);
    priority_queue<pll,vector<pll>,greater<pll>> Q1;
    for(int i=0;i<n;i++){uft[i]=i;}
    for(int i=0;i<n;i++){cin>>a[i].F; a[i].S=i; Q1.push(a[i]);}
    priority_queue<pair<ll,pll>,vector<pair<ll,pll>>,greater<pair<ll,pll>>> Q;
    pll err={E,E};
    late_seg_tree<pll,pll> T(n,err,err),T2(n,err,err);
    while(!Q1.empty()){
        pll W=Q1.top(); Q1.pop();
        pll E=T.search(0,W.S);
        if(E!=err){Q.push({E.F+W.F+d*W.S,{W.S,E.S}});}
        E=T2.search(W.S,n);
        if(E!=err){Q.push({E.F+W.F+d*(n-W.S),{W.S,E.S}});}
        T.update(W.S,W.S+1,{W.F-d*W.S,W.S});
        T2.update(W.S,W.S+1,{W.F-d*(n-W.S),W.S});
    }
    ll ans=0;
    while(!Q.empty()){
        pair<ll,pll> E=Q.top(); Q.pop();
        if(parent(E.S.F)!=parent(E.S.S)){
            ans+=E.F;
            merge(E.S.F,E.S.S);
        }
    }
    cout<<ans<<endl;
    
    
    return 0;
}


//区間加算、区間和
template<typename T,typename U>
T late_seg_tree<T,U>::F(T a,T b){
    return min(a,b);
}

template<typename T,typename U>
T late_seg_tree<T,U>::G(T a,U b,ll where){
    return min(a,b);
}

template<typename T,typename U>
U late_seg_tree<T,U>::H(U a,U b){
    return min(a,b);
}

template<typename T,typename U>
T late_seg_tree<T,U>::I(T a,U b,ll l,ll r){
    return min(a,b);
}


Measured memory_bytes: 59112