#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define st first
#define nd second
#define ld long double
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<ll> a (n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = 0;
for (int i = 0; i < n; i++) {
bool b = 0;
for (int j = 0; j < n-1; j++) {
if (abs(a[j]-a[j+1]) > k) {
if (a[j+1] < a[j]) {
ans += a[j]-a[j+1]-k;
a[j+1] = a[j]-k;
b = 1;
}
else {
ans += a[j+1]-a[j]-k;
a[j] = a[j+1]-k;
b = 1;
}
}
}
if (!b) {
break;
}
}
cout << ans << '\n';
}
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; #define ll long long #define st first #define nd second #define ld long double int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; vector<ll> a (n); for (int i = 0; i < n; i++) { cin >> a[i]; } ll ans = 0; for (int i = 0; i < n; i++) { bool b = 0; for (int j = 0; j < n-1; j++) { if (abs(a[j]-a[j+1]) > k) { if (a[j+1] < a[j]) { ans += a[j]-a[j+1]-k; a[j+1] = a[j]-k; b = 1; } else { ans += a[j+1]-a[j]-k; a[j] = a[j+1]-k; b = 1; } } } if (!b) { break; } } cout << ans << '\n'; } |
English