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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,k;
    cin>>n>>k;
    vector <int> v;
    long long wyn=0;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        v.push_back(x);
    }
    for(int i=0; i<n-1; i++){
        if(v[i]>v[i+1]){
            if(v[i]-v[i+1]>k){
                wyn+=abs(v[i+1]-(v[i]-k));
                v[i+1]=v[i]-k;
            }
        }
        else{
            if(v[i+1]-v[i]>k){
                wyn+=abs(v[i]-(v[i+1]-k));
                v[i]=v[i+1]-k;
            }
        }
    }
    for(int i=n-1; i>0; i--){
        if(v[i]>v[i-1]){
            if(v[i]-v[i-1]>k){
                wyn+=abs(v[i-1]-(v[i]-k));
                v[i-1]=v[i]-k;
            }
        }
        else{
            if(v[i-1]-v[i]>k){
                wyn+=abs(v[i]-(v[i-1]-k));
                v[i]=v[i-1]-k;
            }
        }
    }
    cout<<wyn;
}
/*
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n,k;
    cin>>n>>k;
    vector <int> v;
    long long wyn=0;
    for(int i=0; i<n; i++){
        int x;
        cin>>x;
        v.push_back(x);
    }
    for(int i=0; i<n-1; i++){
        if(v[i+1]-v[i]>k){
            wyn+=abs(v[i]-(v[i+1]-k));
            v[i]=v[i+1]-k;
        }
    }
    for(int i=n-1; i>0; i--){
        if(v[i-1]-v[i]>k){
            wyn+=abs(v[i]-(v[i-1]-k));
            v[i]=v[i-1]-k;
        }
    }
    for(int i=0; i<n; i++)
        cout<<v[i]<<' ';
cout<<'\n';
    cout<<wyn;
}
*/