Hi everybody! Can any one help me solving this problem.
Given an array of n integers in range 1 to 106 (1 ≤ n ≤ 103), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?
I'm stuck on this problem!
Hi everybody! Can any one help me solving this problem.
Given an array of n integers in range 1 to 106 (1 ≤ n ≤ 103), find the minimum steps to make the absolute difference of every two numbers less than or equal to one?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en5 |
|
mohammad74 | 2017-08-30 10:59:06 | 112 | Example added. | |
| en4 |
|
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 |
|
mohammad74 | 2017-08-30 10:51:09 | 84 | What is steps! | |
| en2 |
|
mohammad74 | 2017-08-30 10:49:39 | 18 | LaTex Edit | |
| en1 |
|
mohammad74 | 2017-08-30 10:48:21 | 255 | Initial Revision (published) |