Problem 42837. Increasing sub-sequence (Level 1)

Created by HH

Solve Later

Given a vector, v, of real numbers, return a positive integer, n, representing the longest contiguous increasing sub-sequence contained in v.

Example:

v = [2 18 9 6 11 20 25 3]

n = 4

Solve

Solution Stats

Last solution submitted on Jun 20, 2018

Last 200 Solutions

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 42837. Increasing sub-sequence (Level 1)

Solution Stats

Last 200 Solutions

Solution Comments

Recent Solvers15

Suggested Problems

More from this Author34

Tags

Problem 42837. Increasing sub-sequence (Level 1)

Solution Stats

Last 200 Solutions

Solution Comments

Recent Solvers15

Suggested Problems

More from this Author34

Tags

Players