Problem 42838. Increasing sub-sequence (Level 2)

Created by HH

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This is the next step up from</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/42837-increasing-sub-sequence-level-1\"><w:r><w:t>Problem 42837</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Given a vector, v, of real numbers, return a positive integer, n, representing the longest non-contiguous increasing sub-sequence contained in v.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>v = [</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>2</w:t></w:r><w:r><w:t> 18 9</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>6 11 20 25</w:t></w:r><w:r><w:t> 3]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>n = 5</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

109 Solutions
16 Solvers

Last Solution submitted on Jun 06, 2022

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Jean-Marie Sainthillier on 29 Apr 2016

The purpose of this problem is strange.

Solution Comments

Solution 1557814

2 Comments

2 Comments

bainhome on 12 Jun 2018

this one nice. first I use nchoosek making an air crash code, searching for full combination, then the efficiency was depression manufacturer. When I gazing the corner "busy" sign, I wanna put a bullet in my mouth just for producing that kinda crap...

J. S. Kowontan on 12 Jun 2018

@Bainhome Sigh...my impatience while solving this problem really let me down this time. Otherwise, I could have gotten a lesser size using the Graph and Network approach from my rough sketch.

Solution 1372707

2 Comments

2 Comments

A. Sawas on 7 Dec 2017

I wrote this solution which passed all the tests but still it is wrong.
for example the LIS of the following sequence v=[6 9 8 7 1 2 4 3] shall be 6 while the solution gives 5.
So please add this example to the test suite

A. Sawas on 7 Dec 2017

I wrote this solution which passed all the tests but still it is wrong. for example the LIS of the following sequence v=[0 8 4 12 2 10 6 14 1 9 5 13 3 11 7 15] shall be 6 while the solution gives 5. So please add this example to the test suite

Solution 913537

1 Comment

1 Comment

A. Sawas on 8 Dec 2017

This solution is wrong. It does not pass test#6.

Solution 885264

1 Comment

1 Comment

bainhome on 11 Jun 2018

truly elegant one.

Solution 884143

2 Comments

2 Comments

Jan Orwat on 29 Apr 2016

This solution is totally wrong.

HH on 1 May 2016

Right, and now the test suite catches it. Thanks.

Problem Recent Solvers16

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 42838. Increasing sub-sequence (Level 2)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers16

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Problem 42838. Increasing sub-sequence (Level 2)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers16

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Players