GPD2021

https://www.acmicpc.net/problem/13220 const [n, a, b] = require('fs') .readFileSync('./dev/stdin') .toString() .trim() .split('\n') .map((v) => v.trim());/** * @param {string} word * @return {number[]} */function buildPatternTable(word) { const patternTable = [0]; let prefixIndex = 0; let suffixIndex = 1; while (suffixIndex 0) { wordIndex = patternTable[wordIndex - 1]; } else { textInd..

https://boj.ma/9251 9251번: LCS boj.ma LCS 설명 GOAT [알고리즘] 그림으로 알아보는 LCS 알고리즘 - Longest Common Substring와 Longest Common SubsequenceLCS는 주로 최장 공통 부분수열(Longest Common Subsequence)을 말합니다만, 최장 공통 문자열(Longest Common Substring)을 말하기도 합니다.velog.io const [N, M] = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n');const dp = Array.from(Array(N.length + 1), () => Array(M.length..

https://www.acmicpc.net/problem/5525const [N, M, S] = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n');let i = 0;let cnt = 0;let answer = 0;while (i

https://www.acmicpc.net/problem/17500 class Item { next = null; constructor(value) { this.value = value; }}class Queue { head = null; tail = null; size = 0; constructor() {} push(value) { const node = new Item(value); if (this.head == null) { this.head = node; } else if (this.tail) { this.tail.next = node; } this.tail = node; this.size += 1; } pop() { if (this.head) { const popItem..