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(0);
    cin.tie(0);
    cout.tie(0);

    long long n, k;
    cin>>n>>k;

    vector<long long> tab(n+1);

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

    bool czy = 1;
    long long wyn = 0;

    while(czy){

        czy = 0;
        for(long long i=1; i<n; i++){
            if(tab[i] + k < tab[i+1]){
                wyn += tab[i+1] - tab[i] - k;
                tab[i] = tab[i+1] - k;
                czy = 1;
            }
            else if(tab[i+1] + k < tab[i]){
                wyn += tab[i] - tab[i+1] - k;
                tab[i+1] = tab[i] - k;
                czy = 1;
            }
        }

    }

    cout<<wyn<<"\n";
    return 0;
}