#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <queue>
using namespace std;
constexpr int mx = 1e3 + 7;
int tab[mx];
bool isUsed[mx];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int sum = 0;
int n, k;
cin >> n >> k;
int x;
for (int i = 1; i <= n; i++){
cin >> tab[i];
}
if (n == 1)
{
cout << "0\n";
return 0;
}
int aktMx = -1;
int aktIndex = -1;
int differential;
for (int j = 0; j < n; j++) {
aktIndex = aktMx = -1;
for (int i = 1; i <= n; i++) {
if (aktMx < tab[i] && isUsed[i] == false) {
aktMx = tab[i];
aktIndex = i;
}
}
isUsed[aktIndex] = true;
if (aktIndex == 1) {
differential = abs(tab[aktIndex] - tab[aktIndex + 1]);
if (differential > k) {
tab[aktIndex + 1] += (differential - k);
sum += (differential - k);
}
}
else if (aktIndex == n) {
differential = abs(tab[aktIndex] - tab[aktIndex - 1]);
if (differential > k) {
tab[aktIndex - 1] += (differential - k);
sum += (differential - k);
}
}
else {
differential = abs(tab[aktIndex] - tab[aktIndex + 1]);
if (differential > k) {
tab[aktIndex + 1] += (differential - k);
sum += (differential - k);
}
differential = abs(tab[aktIndex] - tab[aktIndex - 1]);
if (differential > k) {
tab[aktIndex - 1] += (differential - k);
sum += (differential - k);
}
}
}
cout << sum << '\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 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 | #include <iostream> #include <vector> #include <algorithm> #include <math.h> #include <set> #include <queue> using namespace std; constexpr int mx = 1e3 + 7; int tab[mx]; bool isUsed[mx]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int sum = 0; int n, k; cin >> n >> k; int x; for (int i = 1; i <= n; i++){ cin >> tab[i]; } if (n == 1) { cout << "0\n"; return 0; } int aktMx = -1; int aktIndex = -1; int differential; for (int j = 0; j < n; j++) { aktIndex = aktMx = -1; for (int i = 1; i <= n; i++) { if (aktMx < tab[i] && isUsed[i] == false) { aktMx = tab[i]; aktIndex = i; } } isUsed[aktIndex] = true; if (aktIndex == 1) { differential = abs(tab[aktIndex] - tab[aktIndex + 1]); if (differential > k) { tab[aktIndex + 1] += (differential - k); sum += (differential - k); } } else if (aktIndex == n) { differential = abs(tab[aktIndex] - tab[aktIndex - 1]); if (differential > k) { tab[aktIndex - 1] += (differential - k); sum += (differential - k); } } else { differential = abs(tab[aktIndex] - tab[aktIndex + 1]); if (differential > k) { tab[aktIndex + 1] += (differential - k); sum += (differential - k); } differential = abs(tab[aktIndex] - tab[aktIndex - 1]); if (differential > k) { tab[aktIndex - 1] += (differential - k); sum += (differential - k); } } } cout << sum << '\n'; return 0; } |
English