#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for(int i=0; i<n; i++) {
cin >> arr[i];
}
int k;
cin >> k;
if (n == 1) {
cout << "Minimum Jumps : 0\n";
return 0;
}
vector<int> dp(n, 0);
dp[0] = 0;
dp[1] = abs(arr[0] - arr[1]);
for(int i=2; i<n; i++) {
int answer = INT_MAX;
int j = 1;
while(j<=k && i-j>=0) {
// i - j ---> i
int option = dp[i-j] + abs(arr[i] - arr[i-j]);
answer = min(answer, option);
j++;
}
dp[i] = answer;
}
cout << "Minimum Jumps : " << dp[n-1];
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCXZlY3RvcjxpbnQ+IGFycihuKTsKCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJY2luID4+IGFycltpXTsKCX0KCQoJaW50IGs7CgljaW4gPj4gazsKCQoJaWYgKG4gPT0gMSkgewogICAgICAgIGNvdXQgPDwgIk1pbmltdW0gSnVtcHMgOiAwXG4iOwogICAgICAgIHJldHVybiAwOwogICAgfQogICAgCgl2ZWN0b3I8aW50PiBkcChuLCAwKTsKCQoJZHBbMF0gPSAwOwoJCglkcFsxXSA9IGFicyhhcnJbMF0gLSBhcnJbMV0pOwoJCglmb3IoaW50IGk9MjsgaTxuOyBpKyspIHsKCQlpbnQgYW5zd2VyID0gSU5UX01BWDsKCQkKCQlpbnQgaiA9IDE7CgkJd2hpbGUoajw9ayAmJiBpLWo+PTApIHsKCQkJLy8gaSAtIGogLS0tPiBpCgkJCWludCBvcHRpb24gPSBkcFtpLWpdICsgYWJzKGFycltpXSAtIGFycltpLWpdKTsKCQkJYW5zd2VyID0gbWluKGFuc3dlciwgb3B0aW9uKTsKCQkJaisrOwoJCX0KCQlkcFtpXSA9IGFuc3dlcjsKCX0KCQoJY291dCA8PCAiTWluaW11bSBKdW1wcyA6ICIgPDwgZHBbbi0xXTsKCQoJcmV0dXJuIDA7Cn0=