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

using namespace std;

int wynik = 0;
int tab[1007];
priority_queue<pair<int, int>> pq;

void upgrade(int ind, int wysokosc)
{
    if(tab[ind] < wysokosc)
    {
        wynik += wysokosc - tab[ind];
        tab[ind] = wysokosc;
        pq.push({wysokosc, ind});
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, roznica;
    pair<int, int> p;
    cin >> n >> roznica;
    for(int i = 0; i < n; i++)
    {
        cin >> tab[i];
        pq.push({tab[i], i});
    }
    if(n == 1)
    {
        cout << 0;
        return 0;
    }
    while(pq.size())
    {
        p = pq.top();
        pq.pop();
        if(p.second != 0)
        {
            upgrade(p.second - 1, p.first - roznica);
        }
        if(p.second != n - 1)
        {
            upgrade(p.second + 1, p.first - roznica);
        }
    }
    cout << wynik;
    return 0;
}