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
#include<bits/stdc++.h>
#define s second
using namespace std;
typedef long long ll;

int tab[1007];

int main()
{
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        int a;
        cin >> a;
        tab[i] = a;
    }
    int ans = 0;
    for(int j = 0; j < 1000; j++)
    {
        for(int i = 1; i <= n; i++)
        {
            int maxym = max(tab[i-1], tab[i+1]);
            ans += max(0, (maxym-tab[i]-k));
            tab[i] += max(0, (maxym-tab[i]-k));
        }
    }
    cout << ans;
}