I'm stuck on this problem!

Revision en1, by mohammad74, 2017-08-30 10:48:21

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

Given an array of n integers in range 1 to 106 (1 <= n <= 1000), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?

Tags #algorithms, #dp

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English mohammad74 2017-08-30 10:59:06 112 Example added.
en4 English mohammad74 2017-08-30 10:52:35 3 Tiny change: 'r and add it to an adj' -> 'r and add 1 to an adj'
en3 English mohammad74 2017-08-30 10:51:09 84 What is steps!
en2 English mohammad74 2017-08-30 10:49:39 18 LaTex Edit
en1 English mohammad74 2017-08-30 10:48:21 255 Initial Revision (published)