Hello friends,

I have a dynamic programming problem and would like to discuss it here.The problem goes as

Given an integer array A[0....i] convert it to an array of strictly increasing numbers.

The operations allowed are

1)Decrease an element by amount x: cost of operation=x

2)Delete an element k: cost of operation =k

And of course we have to find a solution with minimum cost .