#include<bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int ai;
cin >> ai;
a[i] = ai;
}
int r = 0;
for (int i = 1; i < n; i++) {
if (a[i-1] - k > a[i]) {
int b = a[i-1] - k - a[i];
a[i] = a[i-1] - k;
r += b;
}
}
for (int i = n-1; i >=0; i--) {
if (a[i+1] - k > a[i]) {
int b = a[i+1] - k - a[i];
a[i] = a[i+1] - k;
r += b;
}
}
cout << r;
}
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 | #include<bits/stdc++.h> using namespace std; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); int n, k; cin >> n >> k; vector<int> a(n); for (int i = 0; i < n; i++) { int ai; cin >> ai; a[i] = ai; } int r = 0; for (int i = 1; i < n; i++) { if (a[i-1] - k > a[i]) { int b = a[i-1] - k - a[i]; a[i] = a[i-1] - k; r += b; } } for (int i = n-1; i >=0; i--) { if (a[i+1] - k > a[i]) { int b = a[i+1] - k - a[i]; a[i] = a[i+1] - k; r += b; } } cout << r; } |
English