시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 1 1 1 100.000%

## 문제

Squeaky the Mouse has recently gained an appreciation for the visual arts, and is now attempting his own work of art to be put on display in the most prestigious visual arts festival in town.

His artwork consists of many stacks of similar-sized illuminated cubes arranged to form a line. More precisely, there are N stacks, numbered from 1 to N from left to right, and stack i contains S[i] cubes. The following is one possibility of Squeaky’s artwork:

Figure 5: Possible artwork configuration, with N = 20

As the cubes are massive, assembling the cubes to form the artwork is a very exhausting task, and Squeaky was only able to complete its assembly a few days before the start of the festival.

Just as he thought he was able to finally take a break, the safety committee came around to assess his artwork. The safety committee at this festival has been very particular and uncompromising ever since a disastrous mishap occurred during the festival last year.

When Squeaky saw the committee huddling together and speaking to one another in hushed voices, his heart sank. He knew that they found an issue with his work. Eventually, some members of the committee approached him and explained their concern: Some of the stacks might topple over when visitors bump into the artwork. Specifically, the artwork is only safe if the heights of adjacent stacks differ by no more than H cubes; equivalently, |S[i] − S[i + 1]| ≤ H for all 1 ≤ i ≤ N − 1.

They then gave him two choices – either alter the artwork to make it safe, or remove the artwork completely.

Of course, having spent so much effort on this piece, Squeaky didn’t consider removing the artwork to be an option at all, so he opted to alter the artwork by adding and removing some cubes. As carrying cubes around is tiring, he wants to minimize the amount of work he needs to do.

Formally, he wants to minimise the number of steps needed to make his artwork safe, where each step is one of the following:

• Add one cube to the top of stack k
• Remove one cube from the top of stack k

Help Squeaky determine the minimum number of steps he needs to make his artwork safe.

## 입력

The first line of input contains two positive integers, N and H.

The second line of input contains N non-negative integers. The ith integer on this line is S[i].

## 출력

Your program must output a single integer — the minimum number of operations required to make the artwork safe.

## 제한

• 1 ≤ N ≤ 200 000
• 0 ≤ H ≤ 1 000 000 000
• 0 ≤ S[i] ≤ 1 000 000 000 for all 1 ≤ i ≤ N

## 예제 입력 1

6 1
2 10 0 2 4 3


## 예제 출력 1

10


Figure 6: Possible solution for sample testcase 1. Original artwork is on the left; altered artwork is on the right. Cubes highlighted in red represent those that need to be removed from the original artwork; cubes highlighted in yellow represent those that need to be added to the altered artwork.

The above figure demonstrates a way to make the artwork safe. The artwork is safe because the height of each pair of adjacent stacks differ by no more than one.

## 예제 입력 2

6 3
2 10 2 6 4 3


## 예제 출력 2

6


Figure 7: Possible solution for sample testcase 2.

At least six steps are needed to make the artwork safe. Hence, the correct output is 6.

## 예제 입력 3

4 1
1 4 1 4


## 예제 출력 3

4


Figure 8: Possible solution for sample testcase 3.

At least four steps are needed to make the artwork safe. Hence, the correct output is 4.

## 예제 입력 4

10 1
10 9 8 7 6 5 4 3 2 1


## 예제 출력 4

0


Figure 9: Artwork in sample testcase 4.

The artwork is already safe, so no alterations are needed. Hence, the answer is 0.

## 예제 입력 5

3 0
1 1 3


## 예제 출력 5

2


Figure 10: Possible solution for sample testcase 5.

At least two steps are needed to make the artwork safe. Hence, the correct output is 2.