Crossing Blocks

Chef is very adventurous, so he asked Bob to give him a task. Bob gave him a sequence of blocks with heights $A_1, A_2, \ldots, A_N$. Chef is at the first block and he has to reach the $N$-th block using the minimum number of moves to complete the task. In one move, he can jump from the $i$-th block to the $j$-th block only if the following conditions are satisfied: - $i \lt j$ - $A_i \geq A_j$