![]()
https://www.acmicpc.net/problem/17615 코드 (100점)import sysinput = sys.stdin.readlinen = int(input().strip())balls = input().strip()red_right = (balls.rstrip('R')).count('R')red_left = (balls.lstrip('R')).count('R')blue_right = (balls.rstrip('B')).count('B')blue_left = (balls.lstrip('B')).count('B')print(min([red_right, red_left, blue_left, blue_right])) 빨간색과 파란색이 각각 왼쪽으로 몰았을 때와 오른쪽으로 몰았을 때의 이동 횟수..
https://www.acmicpc.net/problem/13397코드import sysinput = sys.stdin.readlinen, m = map(int, input().split())arr = list(map(int, input().split()))def count_section(target): max_value = min_value = arr[0] cnt = 1 for i in range(1, n): if max_value arr[i]: min_value = arr[i] if max_value - min_value > target: cnt += 1 max_value = min_value = a..
https://www.acmicpc.net/problem/11085코드from heapq import heappop, heappushimport sysinput = sys.stdin.readlinep, w = map(int, input().split())c, v = map(int, input().split())parent = [i for i in range(p)]def find_parent(x): if x != parent[x]: parent[x] = find_parent(parent[x]) return parent[x]def union(a, b): a = find_parent(a) b = find_parent(b) if a == b: return ..
https://www.acmicpc.net/problem/13335코드const fs = require("fs");const filePath = process.platform === "linux" ? "dev/stdin" : "./input.txt";const [n, w, l, ...arr] = fs .readFileSync(filePath) .toString() .trim() .split(/\s/) .filter((item) => item != "") .map((item) => +item);class TruckNode { constructor(weight) { this.next = null; this.weight = weight; this.dist = 0; }}class ..
https://www.acmicpc.net/problem/1700코드n, k = map(int, input().split())orders = list(map(int, input().split()))answer = 0multitap = set()for i in range(k): # 이미 꽂혀있는지 확인 if orders[i] in multitap: continue # 빈 칸이 있는지 확인 if len(multitap) max_latest_use: change_plug = plug max_latest_use = latest_use multitap.remove(change_plug) multitap.add(orders[i])..
