๐ ์ฒ์์ ์์ชฝ ๋ฐ๋ณต๋ฌธ์์ arr[j] < arr[i] ์ด๋ฉด break๋ฅผ ํด์ฃผ์ด์ ํ๋ ธ๋ค. ํ์ฌ ์ธ๋ฑ์ค ๋ณด๋ค ์์ ์ธ๋ฑ์ค๋ฅผ ๋ค ํ์ธํด์ฃผ์ด์ผํ๋ค.
์ฝ๋
const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');
const N = +input.shift();
const arr = input[0].split(" ").map(Number);
const dp = new Array(N).fill(0);
for (let i = 0; i < N; i++) {
dp[i] = arr[i];
for (let j = 0; j < i; j++) {
if (arr[j] < arr[i]) {
dp[i] = Math.max(dp[j] + arr[i], dp[i]);
}
}
}
console.log(Math.max(...dp));