#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<algorithm>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define int long long
using namespace std;
const int oo = 1e18;
struct ST{
int n;
vector<int> tree;
ST(int size){
n = size;
tree.resize(4 * n);
}
void build(int node, int start, int end, vector<int>& a){
if(start == end){
tree[node] = a[start];
}
else{
int mid = (start + end) / 2;
build(2 * node, start, mid, a);
build(2 * node + 1, mid + 1, end, a);
tree[node] = min(tree[2 * node], tree[2 * node + 1]);
}
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return oo;
if(start >= l && end <= r) return tree[node];
int mid = (start + end) / 2;
int l1 = query(2 * node, start, mid, l, r);
int r1 = query(2 * node + 1, mid + 1, end, l, r);
return min(l1, r1);
}
};
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int mxn = *max_element(a.begin(), a.end()) + 1;
int mn = oo;
vector<vector<int>> dp(n, vector<int>(mxn, oo));
// dp[i][j] = dp[i - 1][]
for(int i = 0; i < mxn; i++){
dp[0][i] = abs(i - a[0]);
}
// for(int i = 1; i < mxn; i++){
// for(int j = 0; j < mxn; j++){
// for(int q = 0; q < mxn; q++){
// int diff = 0;
// if(abs(a[j] - a[q]) > k){
// diff = abs(a[j] - a[q]) - k;
// }
// dp[i][j] = dp[i - 1][q] + diff;
// }
// }
// }
ST st(mxn);
for(int i = 1; i < n; i++){
st.build(1, 0, n - 1, dp[i - 1]);
for(int j = 0; j < mxn; j++){
// for(int s = max(0LL, j - k); s <= min(mxn - 1, j + k); s++){
// dp[i][j] = min(dp[i][j], dp[i - 1][s] + abs(j - a[i]));
// }
int l = max(0LL, j - k);
int r = min(mxn - 1,j + k);
dp[i][j] = st.query(1, 0, n - 1, l, r) + abs(j - a[i]);
}
}
for(int i = 0; i < mxn; i++){
mn = min(mn, dp[n - 1][i]);
}
cout << mn;
}
