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

using namespace std;

int main()
{
    int n,k;
    cin>>n>>k;
    vector <int> v(n+3, 0), dp(n+3, 0);
    
    for (int i = 0; i < n; i++)
    {
        cin>>v[i];
        dp[i] = v[i];
    }
    
    for (int i = 1; i < n; i++)
    {
        dp[i] = max(dp[i], dp[i-1] - k);
    }
    for (int i = n-2; i >= 0; i--)
    {
        dp[i] = max(dp[i], dp[i+1] - k);
    }
    
    int wyn = 0;
    for (int i = 0; i < n; i++)
    {
        wyn += abs(dp[i] - v[i]);
    }
    cout<<wyn;
}