Problem 42837. Increasing sub-sequence (Level 1)

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>Given a vector, v, of real numbers, return a positive integer, n, representing the longest 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 = [2 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 = 4</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

62 Solutions
23 Solvers

Last Solution submitted on Jun 06, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 1564789

1 Comment

1 Comment

bainhome on 20 Jun 2018

Learned from Solution 883700, by Tim. run this just for checking: I reckon that function "sum" in that solution is redundant, and my guessing seems to be right.

Solution 885088

2 Comments

2 Comments

Jan Orwat on 2 May 2016

Quick response! Seems 0 is better than infinity...

Peng Liu on 2 May 2016

lol~ yes, in terms of code size, 0 is better than Inf :-)

Problem Recent Solvers23

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 42837. Increasing sub-sequence (Level 1)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author35

Problem Tags

Community Treasure Hunt

Problem 42837. Increasing sub-sequence (Level 1)

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author35

Problem Tags

Community Treasure Hunt

Players