using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<long, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    List<Edge> Q;
    long[] A;
    long D;
    SegTree<pair> S, T;

    void dfs(int l, int r)
    {
        if (r <= l) return;
        int mid = (l + r) / 2;

        int idx = S.Run(mid + 1, r).s;
        for (int i = l; i <= mid; i++)
        {
            Q.Add(new Edge(i, idx, A[i] + A[idx] + D * Abs(i - idx)));
        }
        idx = T.Run(l, mid).s;
        for (int i = mid + 1; i <= r; i++)
        {
            Q.Add(new Edge(i, idx, A[i] + A[idx] + D * Abs(i - idx)));
        }

        dfs(l, mid);
        dfs(mid + 1, r);
    }
    void solve()
    {
        int N = cin.nextint;
        D = cin.nextlong;
        A = cin.scanlong;
        Q = new List<Edge>();
        S = new SegTree<pair>(N, merge, new pair(long.MaxValue, -1), Enumerable.Range(0, N).Select(i => new pair(A[i] + i * D, i)).ToArray());
        T = new SegTree<pair>(N, merge, new pair(long.MaxValue, -1), Enumerable.Range(0, N).Select(i => new pair(A[i] - i * D, i)).ToArray());

        dfs(0, N - 1);

        var G = new DisjointSet(N);
        long ans = 0;
        Q.Sort();
        foreach(var d in Q)
        {
            if (!G.Same(d.from, d.to))
            {
                G.Unite(d.from, d.to);
                ans += d.cost;
            }
        }

        WriteLine(ans);
    }
    static pair merge(pair a, pair b)
    {
        return a.f < b.f ? a : b;
    }
}

class SegTree<T>
{
    readonly int n;
    int s, t;
    T[] tr;
    readonly Func<T, T, T> f;
    readonly T exnum;

    /// <summary>
    ///  セグメントツリーの構築1
    /// </summary>
    /// <param name="m">要素数</param>
    /// <param name="f">マージ関数</param>
    /// <param name="ex">単位元</param>
    public SegTree(int m, Func<T, T, T> f, T ex)
    {
        this.f = f; exnum = ex; n = 1;
        while (n < m) n <<= 1;
        tr = new T[(n << 1) - 1];
        for (int i = 0; i < tr.Length; i++) tr[i] = ex;
    }
    /// <summary>
    /// セグメントツリーの構築2
    /// </summary>
    /// <param name="m">要素数</param>
    /// <param name="f">マージ関数</param>
    /// <param name="ex">単位元</param>
    /// <param name="ini">初期値 <typeparamref name="T"/>? </param>
    public SegTree(int m, Func<T, T, T> f, T ex, T ini) : this(m, f, ex)
    {
        for (int i = 0; i < m; ++i) Assign(i, ini);
        All_Update();
    }
    /// <summary>
    /// セグメントツリーの構築3
    /// </summary>
    /// <param name="m">要素数</param>
    /// <param name="f">マージ関数</param>
    /// <param name="ex">単位元</param>
    /// <param name="ini">初期値 IList<typeparamref name="T"/>? </param>
    public SegTree(int m, Func<T, T, T> f, T ex, IList<T> ini) : this(m, f, ex)
    {
        for (int i = 0; i < m; ++i) Assign(i, ini[i]);
        All_Update();
    }
    /// <summary>
    /// 最下層に値の代入
    /// </summary>
    /// <param name="j">代入するインデックス</param>
    /// <param name="x">代入する値</param>
    public void Assign(int j, T x) => tr[j + n - 1] = x;
    public void Update(int j, T x)
    {
        Assign(j, x);
        Update(j);
    }
    public void Update(int j)
    {
        int i = j + n - 1;
        while (i > 0) { i = i - 1 >> 1; tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    }
    public void All_Update() { for (int i = n - 2; i >= 0; i--) tr[i] = f(tr[i << 1 | 1], tr[i + 1 << 1]); }
    public T Look(int j) => tr[j + n - 1];
    public T Peek() => tr[0];

    ///<summary>return node[s, t]</summary>
    public T Run(int s, int t) { t++; this.s = s; this.t = t; return Query(0, 0, n); }
    T Query(int k, int l, int r) => r <= s || t <= l ? exnum : s <= l && r <= t ? tr[k]
                              : f(Query(k << 1 | 1, l, l + r >> 1), Query(k + 1 << 1, l + r >> 1, r));
}


class Edge : IComparable<Edge>
{
    public int from, to, id; public long cost;
    public Edge(int from, int to, long cost)
    {
        this.from = from;
        this.to = to;
        this.cost = cost;
        id = -1;
    }
    public void set_id(int id)
    {
        this.id = id;
    }
    public int CompareTo(Edge e)
    {
        return cost.CompareTo(e.cost);
    }
}

class DisjointSet
{
    readonly int[] par;
    readonly byte[] rank;
    /// <summary>
    /// 0 から <paramref name="N"/>-1 までの番号がついた <paramref name="N"/> 個の要素からなる集合を作成します．
    /// </summary>
    /// <param name="N">要素数</param>
    /// <remarks>このコンストラクタは O(N) で実行されます．</remarks>
    public DisjointSet(int N)
    {
        par = new int[N];
        rank = new byte[N];
        for (int i = 0; i < N; i++)
            par[i] = -1;
    }
    /// <summary>
    /// 指定した要素が属する集合の代表値を取得します．
    /// </summary>
    /// <param name="id">調べたい要素の 0-indexed での番号</param>
    /// <returns>指定した要素が属する集合の代表値</returns>
    /// <remarks>最悪計算量 O(α(N)) で実行されます．</remarks>
    public int this[int id]
    {
        get
        {
            if (par[id] < 0) return id;
            return par[id] = this[par[id]];
        }
    }
    /// <summary>
    /// 指定した 2 つの要素が属する集合同士を 1 つに統合することを試みます．
    /// </summary>
    /// <param name="x">最初の要素の 0-indexed での番号</param>
    /// <param name="y">2 つ目の要素の 0-indexed での番号</param>
    /// <returns>統合に成功したならば true，そうでなければ false．</returns>
    /// <remarks>最悪計算量 O(α(N)) で実行されます．</remarks>
    public bool Unite(int x, int y)
    {
        x = this[x]; y = this[y];
        if (x == y) return false;
        if (rank[x] < rank[y]) { var tmp = x; x = y; y = tmp; }
        par[x] += par[y];
        par[y] = x;
        if (rank[x] == rank[y])
            rank[x]++;
        return true;
    }
    /// <summary>
    /// 指定した要素が属する集合のサイズを取得します．
    /// </summary>
    /// <param name="x">指定する要素の 0-indexed での番号</param>
    /// <returns>集合のサイズ</returns>
    /// <remarks>最悪計算量 O(α(N)) で実行されます．</remarks>
    public int Size(int x) { return -par[this[x]]; }

    /// <summary>
    /// 指定した 2 つの要素が属する集合が同じかどうかを判定する．計算量 O(α(N))．
    /// </summary>
    /// <param name="x">最初の要素の 0-indexed での番号</param>
    /// <param name="y">2 つ目の要素の 0-indexed での番号</param>
    /// <returns>同じならば true，そうでなければ false．</returns>
    /// <remarks>最悪計算量 O(α(N)) で実行されます．</remarks>
    public bool Same(int x, int y) { return this[x] == this[y]; }

}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f;
    public U s;
    public Pair(T f, U s)
    {
        this.f = f;
        this.s = s;
    }
    public int CompareTo(Pair<T, U> a)
    {
        return f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    }
    public override string ToString()
    {
        return $"{f} {s}";
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values) { WriteLine(string.Join(" ", values)); }
    public static string join<T>(this IEnumerable<T> values, string sep) { return string.Join(sep, values); }
    public static string concat<T>(this IEnumerable<T> values) { return string.Concat(values); }
    public static string reverse(this string s) { return s.Reverse().concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}
