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.