Longest_increasing_subsequenceDP.cpp

#include<bits/stdc++.h>
using namespace std ;

int fxn(vector<int> arr , int n , )
{
    
}

int main()
{   
    vector<int> arr = {50 , 4 , 10 , 8 , 30 , 100} ;
    int n = arr.size() ;
    //Find longest increasing subsequence
    cout<<fxn(arr ,n ) ;
    return 0 ; 
}