LIS_DynamicProgramming

#include<iostream>
#include<vector>
using namespace std;
int main(){
    int n;
    cin>>n;
    int *a = new int [n+2];
    a[0]=INT_MIN;
    a[n+1]=INT_MAX;
    for(int i=1;i<=n;i++) cin>>a[i];
    int F[n+2]={0};
    int vet[n+2];
    vet[1]=0;
    F[0]=1; F[1]=2;
    for(int i=2;i<=n+1;i++){
        for(int j=0;j<i;j++){
            if (a[j]<a[i]){
                if(F[i]<F[j]+1){
                    F[i]=F[j]+1;
                    vet[i]=j;
                }
            }
        }
    }
    vector < int > res;
    int start;
    cout<<F[n+1]-2<<endl;
    int i= vet[n+1];
// truy vet tim ket qua nguoc lai
    while(i >= 0){
        if (i==0){
            res.push_back(a[i]);
            break;
        }
        else {
            res.push_back(a[i]);
            i=vet[i];
        }
    }
    for(int i=res.size()-1;i>=0;i--){
        if (res[i]!=INT_MAX  && res[i]!= INT_MIN){
            cout<<res[i]<<" ";
        }
    }
    return 0;
}