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
37
38
39
40
41
42
#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, k;
    cin >> n >> k;

    vector<int> tab(n);

    for(int i=0; i<n; i++){
        cin >> tab[i];
    }

    bool run = 1;

    long long int ans = 0;

    while(run){
        for(int i=0; i<n-1; i++){
            if(tab[i] < tab[i+1]-k){
                ans += tab[i+1]-k-tab[i];
                tab[i] += tab[i+1]-k-tab[i];
            }

            if(tab[i+1] < tab[i]-k){
                ans += tab[i]-k-tab[i+1];
                tab[i+1] += tab[i]-k-tab[i+1];
            }
        }

        run = 0;

        for(int i=0; i<n-1; i++){
            if(abs(tab[i] - tab[i+1]) > k) run = 1;
        }
    }

    cout << ans;
}