[IndexedTree] baekjoon-2357

Author: Seogeurim

README.md

@@ -97,6 +97,7 @@
 | 06  |     | [Baekjoon-2268 수들의 합](./src/IndexedTree/P2268)               |      |
 | 07  |     | [Baekjoon-12837 가계부 (Hard)](./src/IndexedTree/P12837)         |      |
 | 08  |     | [Baekjoon-11505 구간 곱 구하기](./src/IndexedTree/P11505)         |      |
+| 09  |     | [Baekjoon-2357 최솟값과 최댓값](./src/IndexedTree/P2357)         |      |
 
 ### Trie
 

src/IndexedTree/P2357/Main.java

@@ -0,0 +1,61 @@
+package IndexedTree.P2357;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N, M;
+    static int[] arr;
+    static int[][] segTree;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/IndexedTree/P2357/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+        arr = new int[N+1];
+        for (int i = 1; i <= N; i++) arr[i] = Integer.parseInt(br.readLine());
+
+        segTree = new int[(int) Math.pow(2, Math.ceil(Math.log(N) / Math.log(2)) + 1)][2];
+        makeTree(1, 1, N);
+
+        StringBuilder sb = new StringBuilder();
+        while(M-- > 0) {
+            st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken()), b = Integer.parseInt(st.nextToken());
+            sb.append(getMin(1, 1, N, a, b)).append(" ")
+                    .append(getMax(1, 1, N, a, b)).append("\n");
+        }
+        System.out.println(sb.toString());
+    }
+
+    static void makeTree(int node, int start, int end) {
+        if (start == end) {
+            segTree[node][0] = arr[start];
+            segTree[node][1] = arr[end];
+            return;
+        }
+        makeTree(node*2, start, (start+end)/2);
+        makeTree(node*2+1, (start+end)/2+1, end);
+        segTree[node][0] = Math.min(segTree[node*2][0], segTree[node*2+1][0]);
+        segTree[node][1] = Math.max(segTree[node*2][1], segTree[node*2+1][1]);
+    }
+
+    static int getMin(int node, int start, int end, int a, int b) {
+        if (b < start || end < a) return Integer.MAX_VALUE;
+        if (a <= start && end <= b) return segTree[node][0];
+        return Math.min(getMin(node*2, start, (start+end)/2, a, b),
+                            getMin(node*2+1,(start+end)/2+1, end, a, b));
+    }
+
+    static int getMax(int node, int start, int end, int a, int b) {
+        if (b < start || end < a) return Integer.MIN_VALUE;
+        if (a <= start && end <= b) return segTree[node][1];
+        return Math.max(getMax(node*2, start, (start+end)/2, a, b),
+                getMax(node*2+1,(start+end)/2+1, end, a, b));
+    }
+}

src/IndexedTree/P2357/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-2357] 최솟값과 최댓값
+
+![image](https://user-images.githubusercontent.com/22045163/104977584-35fcca00-5a43-11eb-9741-0a468b3e6739.png)
+
+![image](https://user-images.githubusercontent.com/22045163/104977602-414ff580-5a43-11eb-839a-c60d3778b34c.png)

src/IndexedTree/P2357/input.txt

@@ -0,0 +1,15 @@
+10 4
+75
+30
+100
+38
+50
+51
+52
+20
+81
+5
+1 10
+3 5
+6 9
+8 10