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
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, k, ans = 0, x;
    cin >> n >> k;
    vector<int> ogrod(n);
    for(int i = 0; i < n; ++i) {
        cin >> ogrod[i];
    }

    for(int i = 1; i < n; ++i) {
        if(ogrod[i] >= ogrod[i-1]) {
            continue;
        }
        else {
            if(ogrod[i-1] - ogrod[i] < k) continue;
            x = (ogrod[i-1]-ogrod[i])-k;
            ans += x;
            ogrod[i] += x;
        }
    }

    for(int i = n-2; i >= 0; --i) {
        if(ogrod[i] >= ogrod[i+1]) {
            continue;
        }
        else {
            if(ogrod[i+1] - ogrod[i] < k) continue;
            x = (ogrod[i+1]-ogrod[i])-k;
            ans += x;
            ogrod[i] += x;
        }
    }
    cout << ans;
}