最长连续子序列

前缀和解法

本题数量级不大，可以考虑求解输入序列的前缀和数组，实现O(1)时间复杂度计算任意区间和，关于前缀和可以看：算法设计 - 前缀和 & 差分数列_伏城之外的博客-优快云博客

JS算法源码

const rl = require("readline").createInterface({ input: process.stdin });
var iter = rl[Symbol.asyncIterator]();
const readline = async () => (await iter.next()).value;

void (async function () {
  const nums = (await readline()).split(",").map(Number);
  const target = parseInt(await readline());

  console.log(getResult(nums, target));
})();

function getResult(nums, target) {
  const n = nums.length;

  const preSum = new Array(n + 1).fill(0);
  for (let i = 1; i <= n; i++) {