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
#include <string>
#include <vector>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    long long k;
    if (!(cin >> n >> k)) return 0;

    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    long long totalTrucks = 0;

    for (int i = 0; i < n; i++) {
        long long requiredHeight = a[i];
        // Sprawdzamy wplyw kazdego innego fragmentu j na fragment i
        for (int j = 0; j < n; j++) {
            long long impact = a[j] - abs(i - j) * k;
            requiredHeight = max(requiredHeight, impact);
        }
        totalTrucks += (requiredHeight - a[i]);
    }

    cout << totalTrucks << endl;

    return 0;
}