#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
int arr[555];
int dp[555][555];
int main(){
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n,d;
cin >> n >> d;
int maxi = 0;
for (int z=1;z<=n;z++){
cin >> arr[z];
maxi = max(maxi,arr[z]);
}
for (int z=1;z<=n;z++){
for (int h=0;h<=maxi;h++){
int mini = INT_MAX;
ll i = max(0,h-d);
ll j = min(maxi,h+d);
for (int x=i;x<=j;x++){
mini = min(mini,dp[z-1][x]);
}
dp[z][h] = mini+abs(arr[z]-h);
}
}
int mi = INT_MAX;
for(int z=0;z<=maxi;z++){
mi = min(dp[n][z],mi);
}
cout << mi << endl;
}
