ELIS  Easy Longest Increasing Subsequence
Given a list of numbers A output the length of the longest increasing subsequence. An increasing subsequence is defined as a set {i0 , i1 , i2 , i3 , ... , ik} such that 0 <= i0 < i1 < i2 < i3 < ... < ik < N and A[ i0 ] < A[ i1 ] < A[ i2 ] < ... < A[ ik ]. A longest increasing subsequence is a subsequence with the maximum k (length).
i.e. in the list {33 , 11 , 22 , 44}
the subsequence {33 , 44} and {11} are increasing subsequences while {11 , 22 , 44} is the longest increasing subsequence.
Input
First line contain one number N (1 <= N <= 10) the length of the list A.
Second line contains N numbers (1 <= each number <= 20), the numbers in the list A separated by spaces.
Output
One line containing the lenght of the longest increasing subsequence in A.
Example
Input:
5
1 4 2 4 3 Output: 3
hide comments
mateusshida:
20230505 20:34:47
Easy with algorithm O(n!) 

lambd47:
20230505 20:34:35
Easy with O(n!) 

dobby_1:
20220816 14:11:58
DP or BitMasks 

shiva890:
20220119 07:33:26
Navice solution also got accepted. 

lakshya1st:
20200828 22:54:05
AC in 1 go :)... Warning : Don't try this at home, school or anywhere!! 

s_tank00_:
20200806 18:08:53
very poor test cases no need of memorisation or top down just simple recursion . 

kelvin_0179:
20200512 17:28:50
u really dont need to know any iterative algo.... just use a recurrsion tree with an extra element (here 0) at the root and use memoization and the code works! 

amansahu112:
20200430 15:58:24
n^2 solution dp 

elzahaby:
20190826 19:19:05
DP or Greedy 

sajalagrawal14:
20190625 22:38:25
ac using JaliKati Theorem !!!!! 
Added by:  Omar ElAzazy 
Date:  20120317 
Time limit:  1.948s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 