Node.js)백준 2240번: 자두나무

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

2240번: 자두나무

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n")
const [N, W] = input[0].split(' ').map(Number);
const jadu = input.map(Number);

let dp = Array.from(Array(3), () => Array.from(Array(1004), () => Array(34).fill(0)));
let answer = 0;

for (let i = 1; i <= N; i++) {
  for (let j = 1; j <= W + 1; j++) {
    if (jadu[i] == 1) {
      dp[1][i][j] = Math.max(dp[1][i - 1][j], dp[2][i - 1][j - 1]) + 1;
      dp[2][i][j] = Math.max(dp[1][i - 1][j - 1], dp[2][i - 1][j]);
    } else {
      if (i == 1 && j == 1) continue;
      dp[1][i][j] = Math.max(dp[1][i - 1][j], dp[2][i - 1][j - 1]);
      dp[2][i][j] = Math.max(dp[1][i - 1][j - 1], dp[2][i - 1][j]) + 1;
    }
  }
}

for (let i = 1; i <= W + 1; i++) {
  answer = Math.max(answer, dp[1][N][i],)
  answer = Math.max(answer, dp[2][N][i])
}

console.log(answer)