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

int n, k;
vector <int> a;
vector <pair<int, int>> order;

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

    cin >> n >> k;
    a.resize(n);
    
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    long long sum = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (j > 0 && a[j - 1] > a[j] + k) {
                sum += a[j - 1] - a[j] - k;
                a[j] = a[j - 1] - k;
            }
            if (j < n - 1 && a[j + 1] > a[j] + k) {
                sum += a[j + 1] - a[j] - k;
                a[j] = a[j + 1] - k;
            }
        }
    }

    cout << sum << endl;
}