#include "bits/stdc++.h"
using namespace std;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,k;
cin >> n >> k;
vector<ll> V(n);
for(int i = 0; i < n; i++) {
cin >> V[i];
}
ll result = 0;
for(int j= 0;j<n;j++){
for(int i = 0; i< n-1; i++) {
if(abs(V[i] - V[i+1])>k) {
if(V[i]>V[i+1]){
ll before = V[i+1];
V[i+1]=V[i]-k;
result += V[i+1] - before;
}
else{
ll before = V[i];
V[i]=V[i+1]-k;
result += V[i] - before;
}
}
}
}
cout<<result;
}
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 | #include "bits/stdc++.h" using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); ll n,k; cin >> n >> k; vector<ll> V(n); for(int i = 0; i < n; i++) { cin >> V[i]; } ll result = 0; for(int j= 0;j<n;j++){ for(int i = 0; i< n-1; i++) { if(abs(V[i] - V[i+1])>k) { if(V[i]>V[i+1]){ ll before = V[i+1]; V[i+1]=V[i]-k; result += V[i+1] - before; } else{ ll before = V[i]; V[i]=V[i+1]-k; result += V[i] - before; } } } } cout<<result; } |
English