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
#include<bits/stdc++.h>
using namespace std;
int tab[1009];
int main()
{ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,k;
    cin>>n>>k;
    long long wynik=0;
    priority_queue<pair<int,int>>Q;
    for(int i=1;i<=n;i++)
    {
        cin>>tab[i];
        Q.push({tab[i],i});
    }
    while(!Q.empty())
    {
        int x,ind;
        tie(x,ind)=Q.top();
        Q.pop();
        if(tab[ind]!=x){continue;}
        if(ind-1>=1&&x-tab[ind-1]>k)
        {
            wynik+=(x-k)-tab[ind-1];
            tab[ind-1]=x-k;
            Q.push({tab[ind-1],ind-1});
        }
        if(ind+1<=n&&x-tab[ind+1]>k)
        {
            wynik+=(x-k)-tab[ind+1];
            tab[ind+1]=x-k;
            Q.push({tab[ind+1],ind+1});
        }
    }
    cout<<wynik<<'\n';
    return 0;
}