#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k; cin >> n >> k;
vector<int> a(n);
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
for (int j = i - 1; j >= 0; j--) {
a[j] = max(a[j], a[j + 1] - k);
}
if (i) {
a[i] = max(a[i], a[i - 1] - k);
}
}
cout << accumulate(a.begin(), a.end(), 0) - s;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, k; cin >> n >> k; vector<int> a(n); int s = 0; for (int i = 0; i < n; i++) { cin >> a[i]; s += a[i]; for (int j = i - 1; j >= 0; j--) { a[j] = max(a[j], a[j + 1] - k); } if (i) { a[i] = max(a[i], a[i - 1] - k); } } cout << accumulate(a.begin(), a.end(), 0) - s; } |
English