23572 [백준] 자바 문제 풀이 2357 : 골드1 BOJ 2357 : 최솟값과 최댓값 import java.io.*; import java.util.*; public class Main { static class SegmentTree{ private long[] max_tree; private long[] min_tree; SegmentTree(int n){ double treeHeight = Math.ceil(Math.log(n)/Math.log(2))+1; long treeNodeCount = Math.round(Math.pow(2, treeHeight)); max_tree = new long[Math.toIntExact(treeNodeCount)]; min_tree = new long[Math.toIntExact(treeNodeCount)]; } .. 2023. 10. 6. [백준] 자바 문제 풀이 2357 : 골드1 BOJ 2357 : 최솟값과 최댓값 풀이 코드 import java.io.*; import java.util.*; public class Main { static class SegmentTree{ private long[] max_tree; private long[] min_tree; SegmentTree(int n){ double treeHeight = Math.ceil(Math.log(n)/Math.log(2))+1; long treeNodeCount = Math.round(Math.pow(2, treeHeight)); max_tree = new long[Math.toIntExact(treeNodeCount)]; min_tree = new long[Math.toIntExact(treeNodeCount.. 2023. 10. 4. 이전 1 다음 728x90 반응형