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
#include <bits/stdc++.h>
using namespace std;
int tab[1002];

int main(){
    int n, k, i, d;
    long long  wyn = 0;
    cin >> n >> k;
    for(i = 0; i < n; i++) cin >> tab[i];
    for(i = 1; i < n; i++) {
        if (tab[i-1]- tab[i] > k){
            d = (tab[i-1]- tab[i]) - k;
            tab[i] += d;
            wyn += d;
        }
    }
    for(i = n-2; i >= 0; i--) {
        if (tab[i+1]- tab[i] > k){
            d = (tab[i+1]- tab[i]) - k;
            tab[i] += d;
            wyn += d;
        }
    }

    cout << wyn;


  return 0;
}