Meticulous smoothing
면접 대비시간 제한1초메모리 제한1024 MB
판자의 n개 위치 두께가 주어질 때, 인접한 위치의 두께 차이가 1 이하가 되도록 깎으면서 제거하는 목재의 최소량을 구한다.
문제
The arts and crafts teacher is looking at the beautiful plank you crafted in the woodshop, and gaze at you with a stern look. "This is not smooth enough! Use more sandpaper!"
Your plank is cm long, and the arts and crafts teacher has measured the width of your plank on different locations to prove his point. He demands that the thickness should differ by no more than micrometer between any two consecutive measured location. If the sandpaper will shave off micrometer of wood each time you use it at a particular location, how many times do you need to use the sandpaper?
입력
The first line of input contains a single integer , the length of your plank. On the second line of input follows space-separated integers , the thickness of your plank ( for every ).
출력
Output a single integer, the minimum number of times you need to use the sandpaper (assuming that the sandpaper only touch one location at the same time).