1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
#include<bits/stdc++.h>
using namespace std;


const int N = 2000;
int tab[N];

int main() {
    int n, k;
    cin>>n>>k;
    for(int i=0; i<n; i++) {
        cin>>tab[i];
    }
    int ans = 0;
    if(n == 1) {
        cout<<0;
        return 0;
    }
    for(int j = 0; j< n; j++) {
    for(int i=0; i< n-1; i++) {
        int first = tab[i];
        int second = tab[i+1];
        int diff = abs(first - second);
        if(first < second && diff > k) {
            tab[i] += diff - k;
            ans += diff- k;
        }
        else if(diff > k) {
            tab[i+1] += diff-k;
            ans += diff-  k;
        }
    }
    }

    cout<<ans;
}