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
// Zadanie Dostawa żwiru
// Potyczki algorytmiczne 2026
#include <iostream>
using namespace std;

int main()
{
  unsigned int x, d, h, m;
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL); 
  int n, k;
  int diff, minc = 0;
  cin >> n >> k;
  int *a = new int[n + 1]; // a[0] niewykorzystane
  for (unsigned int i = 1; i <= n; i++)
    cin >> a[i];

  // Równanie spadków od lewej
  for (unsigned int i = 2; i <= n; i++)
  {
    diff = a[i - 1] - a[i] - k;
    if (diff > 0)
    {      
      a[i] += diff;
      minc += diff;
    }
  }
  
  // Równanie spadków od prawej
  for (unsigned int i = n - 1; i >= 1; i--)
  {
    diff = a[i + 1] - a[i] - k;
    if (diff > 0)
    {      
      a[i] += diff;
      minc += diff;
    }
  } 
    
  delete [] a;
  cout << minc << endl;

  // system("pause"); 
}