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
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <string>
using namespace std;

using ll = long long;


int main() {
    int n, k;
    cin >> n >> k;
    vector<int> T(n), vis(n);
    for (int &a : T) {
        cin >> a;
    }
    int res = 0;
    for (int foo = 0; foo < n; foo++) {
        for (int i = 0; i < n; i++) {
            if (i && T[i-1] + k < T[i]) {
                res += T[i] - k - T[i-1];
                T[i-1] = T[i] - k;
            }
            if (i + 1 < n && T[i+1] + k < T[i]) {
                res += T[i] - k - T[i+1];
                T[i+1] = T[i] - k;
            }
        }
    }
    cout << res << endl;
    return 0;
}