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
#include<cstdio>
#include<algorithm>
#include<vector>

using namespace std;

int main() {
  int n,k;
  vector<int> h,minh;
  vector<pair<int,int> > ph;
  scanf("%d %d",&n,&k);
  for(int i=0;i<n;++i){
    int a;
    scanf("%d",&a);
    h.push_back(a);
    minh.push_back(a);
  }
  for(int i=0;i<n;++i) {
    for(int j=0;j<n;++j) {	  
       minh[i]=max(minh[i],h[j]-abs(i-j)*k);
    }
  }
  int s=0;
  for(int i=0;i<n;++i)
    s+=minh[i]-h[i];
  printf("%d\n",s);

  
  return 0;
}