Problem 45473. Sub-sequence - 01

a=[2,4,2,1,3,5,6]
longest increasing subsequence = [2,4,5,6]
                               = [1,3,5,6]
                               = [2,3,5,6]
so, length = 4

Solution Comments

Problem Recent Solvers22

Suggested Problems

• Sum all integers from 1 to 2^n

  17513 Solvers

• Project Euler: Problem 16, Sums of Digits of Powers of Two

  178 Solvers

• Back to basics 23 - Triangular matrix

  1123 Solvers

• What is the distance from point P(x,y) to the line Ax + By + C = 0?

  560 Solvers

• Divisors of an integer

  196 Solvers

More from this Author174

• Jump Search - 02

  4 Solvers

• Wythoff Sequence

  31 Solvers

• Hanging cable - 01

  9 Solvers

• Dominant Matrix - 02

  8 Solvers

• Take a binary number as input,rearrange it in any manner such that its value is greater than the original one.output should be all the possible values in decimal.

  15 Solvers