题解 | #Redraiment的走法#

最长递增子序列

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

function fn(arr) {
    let len = arr.length
    let dp = []
    let max = 0
    for(let i = 0; i < len ; i++) {
        dp[i] = 1
        for(let j = 0; j < i; j++) {
            if(arr[i] > arr[j]) {
                dp[i] = Math.max(dp[j] + 1, dp[i])
            }
            max = Math.max(dp[i], max)
        }      
    }
    return max
}

void async function () {
    // 最长递增子数列
    while(line = await readline()){
        let num = Number(line)
        let arr = (await readline()).split(' ').map(Number)
        console.log(fn(arr))
    }
}()