what is the greedy or dynamic programming approach of this?

Question

we have a sequence of REAL numbers.all of the numbers are unique.we want to have an ascending sequence by changing some of these values.we are allowed to change any arbitrary numbers.how to find the optimum algorithm to determine the minimum number of necessary changes to make this sequence? we can use greedy or dynamic programming approach.

Herokiller · Accepted Answer · 2014-11-12 13:42:28Z

1

first find longest increasing subsequence http://en.wikipedia.org/wiki/Longest_increasing_subsequence

then change all numbers which do not belong to this subsequence to fit the rule

(proof: if we change less numbers and acquire ascending sequence, then the numbers which were not changed were initially forming increasing subsequence longer then 'longest')

answered Nov 12, 2014 at 13:42

Herokiller

3,0015 gold badges34 silver badges54 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

what is the greedy or dynamic programming approach of this?

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related