Node.js) 백준 29718번: 줄줄이 박수

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

29718번: 줄줄이 박수

const input = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' ').map(Number));
const [R, C] = input.shift();
const [A] = input.pop();
let cnt = [];
for (let j = 0; j < C; j++) {
	let total = 0;
	for (let i = 0; i < R; i++) {
		total += input[i][j];
	}
	cnt.push(total);
}

const prefixSum = [0];

let sum = 0;

for (let i = 0; i < cnt.length; i++) {
	sum += cnt[i];
	prefixSum.push(sum);
}
let max = 0;
for (let i = 0; i + A <= C; i++) {
	const value = prefixSum[i + A] - prefixSum[i];
	if (value > max) max = value;
}
console.log(max);