#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n, k, res = 0;
cin >> n >> k;
vector<int> val(n + 1);
for(int i = 0; i < n; i++)
{
cin >> val[i];
}
for(int i = 1; i < n; i++)
{
if(val[i - 1] - val[i] > k)
{
res += (val[i - 1] - k - val[i]);
val[i] = val[i - 1] - k;
}
}
for(int i = n - 2; i >= 0; i--)
{
if(val[i + 1] - val[i] > k)
{
res += (val[i + 1] - k - val[i]);
val[i] = val[i + 1] - k;
}
}
cout << res;
return 0;
}
/*
4 2
7 3 0 2
*/
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 44 45 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int n, k, res = 0; cin >> n >> k; vector<int> val(n + 1); for(int i = 0; i < n; i++) { cin >> val[i]; } for(int i = 1; i < n; i++) { if(val[i - 1] - val[i] > k) { res += (val[i - 1] - k - val[i]); val[i] = val[i - 1] - k; } } for(int i = n - 2; i >= 0; i--) { if(val[i + 1] - val[i] > k) { res += (val[i + 1] - k - val[i]); val[i] = val[i + 1] - k; } } cout << res; return 0; } /* 4 2 7 3 0 2 */ |
English