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

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    long long wyn = 0;
    vector<int> drog(n);
    for(int i=0;i<n;i++)
    {
        cin >> drog[i];
    }
    int fl;
    for(int y=0;y<n;y++)
    {
        fl = 0;
        for(int i=1;i<n;i++)
        {
            if(drog[i] > drog[i-1] && drog[i]-drog[i-1] > k)
            {
                wyn += drog[i]-drog[i-1]-k;
                drog[i-1] += drog[i]-drog[i-1]-k;
                fl = 1;
            }
            if(drog[i] < drog[i-1] && drog[i-1]-drog[i] > k)
            {
                wyn += drog[i-1]-drog[i]-k;
                drog[i] += drog[i-1]-drog[i]-k;
                fl = 1;
            }
        }
        if(fl == 0)
        {
            break;
        }
    }
    cout << wyn;
    return 0;
}