#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
long long initial = 0;
for (int i=0; i<n; i++) {
cin >> a[i];
initial += a[i];
}
for (int i=1; i<n; i++) {
if (abs(a[i] - a[i-1]) <= k) continue;
else if (a[i] < a[i-1]) {
a[i] += a[i-1] - a[i] - k;
}
else {
int j = i-1;
while (j >= 0 && a[j+1] - a[j] > k) {
a[j] += a[j+1] - a[j] - k;
j--;
}
}
}
long long result = 0;
for (auto x: a) {
result += x;
}
cout << result - initial << "\n";
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> a(n); long long initial = 0; for (int i=0; i<n; i++) { cin >> a[i]; initial += a[i]; } for (int i=1; i<n; i++) { if (abs(a[i] - a[i-1]) <= k) continue; else if (a[i] < a[i-1]) { a[i] += a[i-1] - a[i] - k; } else { int j = i-1; while (j >= 0 && a[j+1] - a[j] > k) { a[j] += a[j+1] - a[j] - k; j--; } } } long long result = 0; for (auto x: a) { result += x; } cout << result - initial << "\n"; return 0; } |
English