This is the next step up from Problem 42837.
Given a vector, v, of real numbers, return a positive integer, n, representing the longest non-contiguous increasing sub-sequence contained in v.
v = [ 2 18 9 6 11 20 25 3]
n = 5
The purpose of this problem is strange.
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...
@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.
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
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
This solution is wrong. It does not pass test#6.
truly elegant one.
This solution is totally wrong.
Right, and now the test suite catches it. Thanks.
Remove NaN ?
Sum the entries of each column of a matrix which satisfy a logical condition.
Moving average (variable kernel length)
Mean number of letters per word (Hard)
Regular polygon bounded by and bounding a circle
Aztec Diamond domino tilings
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office