题解 | #Redraiment的走法#
Redraiment的走法
https://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;
void async function () {
const n = parseInt(await readline());
const nums = (await readline()).split(" ").map(Number);
const dp = new Array(n).fill(1);
for(let i = 1; i < n; i++){
for(let j = 0; j < i; j++){
if(nums[i] > nums[j]) dp[i] = Math.max(dp[j]+1,dp[i]);
}
}
console.log(Math.max(...dp))
// console.log(dp)
}()
华为OD,我昵称“od400” 文章被收录于专栏
华为OD机试刷题历程,因涉及华为权益,牛客不允许更新了。我昵称“od400”,某博客继续更新。