Chefs Problem

Chef is a computer science student and his teacher gave him a simple problem to solve within time but he is little busy in his life, so he asked you to solve this problem. Problem statement -: Given an array containing $N$ integers your task is to modify it so that array is increasing (i.e. every element is at least as large as previous element). You can increase any element by $one$ in $one move