Sunny Holic

struct IndexedTree { vector tree; int size; IndexedTree(int n, int *arr) : tree(4 * n, 987654321) { //넉넉하게 4*n 사이즈 배열 생성, 초기값 지정 size = 1; while (size right) return 987654321; //초기값 if (left == nodeLeft && right == nodeRight) return tree[node]; int mid = (nodeLeft + nodeRight) / 2; return min(query(left, right, node * 2, nodeLeft, mid), query(left, right, node * 2 + 1, mid + 1, nodeRight)); } vo..