[백준알고리즘] 알고리즘 연습 - 1912

1912 - 연속합

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

let fs = require('fs');
let input = fs.readFileSync('/dev/stdin').toString().split('\n');

let n = Number(input[0]);
let numbers = input[1].split(" ").map((n) => Number(n));

function answer(arr) {
    for(var i=1; i<arr.length; i++) {
        arr[i] = Math.max(arr[i], arr[i-1] + arr[i]);
    }
    return Math.max(...arr);
}

console.log(answer(numbers));