#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, a;
vector<int> path;
cin >> n >> k;
int prev = 0;
int total_trucks = 0;
for(int i=0; i<n; i++) {
cin >> a;
if(a < prev-k) {
total_trucks += prev-k - a;
a = prev-k;
}
prev = a;
path.push_back(a);
}
prev = 0;
for(int i=n-1; i>=0; i--) {
a = path[i];
if(a < prev-k) {
total_trucks += prev-k - a;
a = prev-k;
}
prev = a;
}
cout<<total_trucks<<"\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 41 42 43 | #include "bits/stdc++.h" using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k, a; vector<int> path; cin >> n >> k; int prev = 0; int total_trucks = 0; for(int i=0; i<n; i++) { cin >> a; if(a < prev-k) { total_trucks += prev-k - a; a = prev-k; } prev = a; path.push_back(a); } prev = 0; for(int i=n-1; i>=0; i--) { a = path[i]; if(a < prev-k) { total_trucks += prev-k - a; a = prev-k; } prev = a; } cout<<total_trucks<<"\n"; return 0; } |
English