From b0e210b73cfc46f2059992cfadc3efacfd6bf34f Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Sun, 24 Aug 2025 09:53:54 +0900
Subject: [PATCH] =?UTF-8?q?[20250824]=20BOJ=20/=20G4=20/=20Elder=20price?=
 =?UTF-8?q?=20robot=20/=20=ED=95=9C=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Ukj0ng/202508/24 BOJ G4 Elder price robot.md | 49 ++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 Ukj0ng/202508/24 BOJ G4 Elder price robot.md

diff --git a/Ukj0ng/202508/24 BOJ G4 Elder price robot.md b/Ukj0ng/202508/24 BOJ G4 Elder price robot.md
new file mode 100644
index 00000000..423cad74
--- /dev/null
+++ b/Ukj0ng/202508/24 BOJ G4 Elder price robot.md	
@@ -0,0 +1,49 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static int[] arr, answer;
+    private static Stack<Integer> stack;
+    private static int N;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        solve();
+
+        for (int i = 0; i < N; i++) {
+            if (answer[i] != -1) bw.write(answer[i] + "\n");
+            else bw.write("infinity" + "\n");
+        }
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+
+        arr = new int[N];
+        answer = new int[N];
+        stack = new Stack<>();
+        Arrays.fill(answer, -1);
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+    }
+
+    private static void solve() {
+        for (int i = 0; i < N; i++) {
+            while (!stack.isEmpty() && arr[stack.peek()] >= arr[i]) {
+                int idx = stack.pop();
+                answer[idx] = i - idx;
+            }
+            stack.push(i);
+        }
+    }
+}
+```