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
#include <iostream>
using namespace std;

int main() {
    int n, k, T[1001];

    cin >> n >> k;

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

    bool changed = false;
    int result = 0;
    do {
        changed = false;
        for (int i = 0; i < n; i++) {
            if (i && T[i-1] < T[i]-k) {
                result += T[i]-k-T[i-1];
                T[i-1] = T[i]-k;
                changed = true;
            }
            if (i < n-1 && T[i+1] < T[i]-k) {
                result += T[i]-k-T[i+1];
                T[i+1] = T[i] - k;
                changed = true;
            }
        }
    } while (changed);

    cout << result << endl;
}