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
45
46
47
48
49
50
51
52
53
54
#include<bits/stdc++.h>
using namespace std;

#define ll long long
using un = unsigned;
#define dbg(X) cout << __LINE__ <<' ' << X << endl;

void solve()
{
    int n,k;
    cin >> n >> k;
    vector<int> a(n+2);
    a[0] = 1e9+7;
    a[n+1] = 1e9+7;
    priority_queue<pair<int,int>> kol;
    int res = 0;
    for(int i = 1;i<n+1;i++)
    {
        cin >> a[i];
        kol.push({a[i],i});
    }
    while(!kol.empty())
    {
        int war = kol.top().first;
        int i = kol.top().second;
        kol.pop();
        if(a[i]!=war)
        {
            continue;
        }
        if(a[i]-a[i-1]>k)
        {
            res += (a[i]-k)-a[i-1];
            a[i-1] += (a[i]-k)-a[i-1];
            kol.push({a[i-1],i-1});
        }
        if(a[i]-a[i+1]>k)
        {
            res += (a[i]-k)-a[i+1];
            a[i+1] += (a[i]-k)-a[i+1];
            kol.push({a[i+1],i+1});
        }
    }
    cout << res;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}