You are given an array of positive integers. Convert it to a sorted array with minimum cost. Only valid operation are 1) Decrement -> cost = 1 2) Delete an element completely from the array -> cost = value of element
For example: 4,3,5,6, -> cost 1 10,3,11,12 -> cost 3 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
