Node.js)백준 13398번: 연속합 2

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

13398번: 연속합 2

const fs = require('fs');
const [n, ...num] = fs.readFileSync("./dev/stdin").toString().trim().split('\n');
const N = +n;
const nums1 = num[0].split(' ').map(Number);
const nums2 = num[0].split(' ').map(Number).reverse();
const dp1 = new Array(N).fill(0);
const dp2 = new Array(N).fill(0);

dp1[0] = nums1[0]
let max = nums1[0]
for(let i = 1; i<N; i++){
  dp1[i] = Math.max(dp1[i-1]+nums1[i],nums1[i]);
  max = Math.max(max,dp1[i]);
}

dp2[0] = nums2[0];
for(let i =1 ; i<N; i++){
  dp2[i] = Math.max(dp2[i-1]+nums2[i], nums2[i])
}

for(let i = 1; i<N-1; i++){
  const temp = dp1[i-1]+dp2[N-2-i]
  max = Math.max(temp,max)  
}

console.log(max)