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
38
39
40
41
42
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin >> n >> k;
    vector <int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    long long wyn = 0;
    for (int i = 0; i < n; i++) {
        int j = i;
        while (j+1 < n && abs(a[j]-a[j+1]) > k) {
            if (a[j] > a[j+1]) {
                wyn+=a[j]-k-a[j+1];
                a[j+1] = a[j]-k;

            } else {
                wyn+=a[j+1]-k-a[j];
                a[j] = a[j+1]-k;
            }
            j++;
        }
        j = i;
        while (j-1 >= 0 && abs(a[j]-a[j-1]) > k) {
            if (a[j] > a[j-1]) {
                wyn+=a[j]-k-a[j-1];
                a[j-1] = a[j] - k;
            }
            else {
                wyn+=a[j-1]-k-a[j];
                a[j] = a[j-1]-k;
            }
            j--;
        }
    }
    cout << wyn << "\n";
}