Node.js)백준 14003번: 가장 긴 증가하는 부분 수열5

https://www.acmicpc.net/problem/14003

14003번: 가장 긴 증가하는 부분 수열 5

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n").map(v => v.split(' ').map(Number))
const [N] = input[0];
const arr = input[1];


function binarySearch(left, right, target) {
  let mid;
  while (left < right) {
    mid = Math.floor((left + right) / 2);

    if (lis[mid] < target) {
      left = mid + 1;
    } else {
      right = mid
    }
  }
  return right;
}

let lis = [];
let records = [];
records[0] = 0;
let j = 0;
lis[0] = arr[0];
let i = 1;

while (i < N) {

  if (lis[j] < arr[i]) {
    lis[++j] = arr[i];
    records[i] = j;
  } else {
    let idx = binarySearch(0, j, arr[i]);
    lis[idx] = arr[i]
    records[i] = idx;
  }
  i++;
}
let answer = [];

let max = Math.max(...records)
const maxIdx = records.indexOf(max)

for (let i = maxIdx; i >= 0; i--) {
  if (records[i] == max) {
    answer.push(arr[i]);
    max--;
  }
  if (max < 0) break;
}


console.log(answer.length)
console.log(answer.reverse().join(' '))