longestContinuesSubseq.js

arr = [5, 2, 8, 6, 3, 6, 5, 5];

longestContinuesSubseq = (a) => {
    let t = Array(a.length).fill(1);

    for(let i=1; i<t.length; i++) {
        let smalerUntilI = [];
        for(let j=0; j<i; j++) {
            if (a[j] < a[i]) {
                smalerUntilI.push(t[j]);
            }
        }

        t[i] = 1 + Math.max(...smalerUntilI);
    }

    return Math.max(...t);
}