#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
vector<int> v;
for(int i=0;i<n;i++) {
int x;
cin>>x;
v.push_back(x);
}
int s = 0;
for (int i = 1; i<n; i++){
if (v[i-1] > v[i]) {
if (v[i-1]-v[i] > k) {
s += v[i-1]-v[i]-k;
v[i] += (v[i-1]-v[i]-k);
}
}
}
for (int i = n-2; i>=0; i--) {
if (v[i+1] > v[i] ) {
if (v[i+1]-v[i] > k) {
s += v[i+1]-v[i]-k;
v[i] += (v[i+1]-v[i]-k);
}
}
}
cout << s << endl;
}
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 | #include <bits/stdc++.h> using namespace std; int main() { int n,k; cin>>n>>k; vector<int> v; for(int i=0;i<n;i++) { int x; cin>>x; v.push_back(x); } int s = 0; for (int i = 1; i<n; i++){ if (v[i-1] > v[i]) { if (v[i-1]-v[i] > k) { s += v[i-1]-v[i]-k; v[i] += (v[i-1]-v[i]-k); } } } for (int i = n-2; i>=0; i--) { if (v[i+1] > v[i] ) { if (v[i+1]-v[i] > k) { s += v[i+1]-v[i]-k; v[i] += (v[i+1]-v[i]-k); } } } cout << s << endl; } |
English