[Gold V] Title: 빗물, Time: 112 ms, Memory: 14332 KB -BaekjoonHub

Author: chech2

백준/Gold/14719. 빗물/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 14508 KB, 시간: 148 ms
+메모리: 14332 KB, 시간: 112 ms
 
 ### 분류
 
 구현, 시뮬레이션
 
 ### 제출 일자
 
-2024년 1월 11일 19:14:02
+2025년 1월 17일 20:49:03
 
 ### 문제 설명
 

백준/Gold/14719. 빗물/빗물.java

@@ -1,35 +1,42 @@
-import java.io.BufferedReader;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-import java.util.stream.Stream;
-
+import java.io.*;
+import java.util.*;
 public class Main {
-
-    static int right, left, high, width, ans;
+    static int h, w;
     static int[] map;
-
+    static StringTokenizer st;
+    static StringBuilder sb;
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
     public static void main(String[] args) throws Exception{
-        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
-        StringTokenizer st = new StringTokenizer(br.readLine());
+        pre_setting();
+        bw.append(sb.append(rain_check()));
+        bw.close();
+    }
 
-        high = Integer.parseInt(st.nextToken());
-        width = Integer.parseInt(st.nextToken());
-        map = Stream.of(br.readLine().split(" ")).mapToInt(Integer :: parseInt).toArray();
-        for (int now = 1; now < map.length - 1; now++) {
-          right = 0;
-          left = 0;
+    private static int rain_check() {
+        int ans, left, right;
 
-            for (int i = 0; i < now; i++) {
-                left = Math.max(map[i], left);
-            }
-            for (int i = now + 1; i < map.length; i++) {
-                right = Math.max(map[i], right);
-            }
-            if(map[now] < right && map[now] < left){
-                ans += Math.min(right, left) - map[now];
-            }
+        ans = 0;
+        for(int now = 1; now < w - 1; now++){
+            left = 0;
+            right = 0;
+            for (int l = 0; l < now; l++) left = Math.max(map[l], left);
+            for (int r = now + 1; r < w; r++) right = Math.max(map[r], right);
+
+            ans += Math.max(Math.min(left, right) - map[now], 0);
         }
-        System.out.println(ans);
+        return ans;
     }
 
+    private static void pre_setting() throws Exception{
+        sb = new StringBuilder();
+        st = new StringTokenizer(br.readLine());
+
+        h = Integer.parseInt(st.nextToken());
+        w = Integer.parseInt(st.nextToken());
+        map = new int[w];
+
+        st = new StringTokenizer(br.readLine());
+        for(int i = 0; i < w; i++) map[i] = Integer.parseInt(st.nextToken());
+    }
 }