Hi everybody! Can any one help me solving this problem.

Given an array of n integers in range 1 to 10⁶ (1 ≤ n ≤ 10³), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?

At each step we can subtract 1 from one number and add it to an adjacent number.