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.
what is the greedy or dynamic programming approach of this?
101 Views Asked by user3070752 At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- python forked processes not executing with os.execlp
- Calling Python file from within PHP
- Run local executable from a remote PHP application
- Client/server: running "nano editor" command from client
- Running multiple exec commands and waiting to finish before continuing
- How to use Maven exec plugin in Eclipse?
- execute php script in command line from web page
- How to run iperf command properly in Runtime.getRuntime().exec() android
- Gradle Exec : Why it is not running in configuration phase?
- Slimerjs with exec linux centos 6
Related Questions in DYNAMIC-PROGRAMMING
- python forked processes not executing with os.execlp
- Calling Python file from within PHP
- Run local executable from a remote PHP application
- Client/server: running "nano editor" command from client
- Running multiple exec commands and waiting to finish before continuing
- How to use Maven exec plugin in Eclipse?
- execute php script in command line from web page
- How to run iperf command properly in Runtime.getRuntime().exec() android
- Gradle Exec : Why it is not running in configuration phase?
- Slimerjs with exec linux centos 6
Related Questions in GREEDY
- python forked processes not executing with os.execlp
- Calling Python file from within PHP
- Run local executable from a remote PHP application
- Client/server: running "nano editor" command from client
- Running multiple exec commands and waiting to finish before continuing
- How to use Maven exec plugin in Eclipse?
- execute php script in command line from web page
- How to run iperf command properly in Runtime.getRuntime().exec() android
- Gradle Exec : Why it is not running in configuration phase?
- Slimerjs with exec linux centos 6
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
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')