From a2b7d6998561acb3db3828b50631034cca1db4c3 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Fri, 31 Oct 2025 19:06:04 +0900
Subject: [PATCH] =?UTF-8?q?[20251031]=20BOJ=20/=20G3=20/=20=EA=B4=84?=
 =?UTF-8?q?=ED=98=B8=20=EC=B6=94=EA=B0=80=ED=95=98=EA=B8=B0=20/=20?=
 =?UTF-8?q?=EC=9D=B4=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...24\352\260\200\355\225\230\352\270\260.md" | 48 +++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 "JHLEE325/202510/31 BOJ G3 \352\264\204\355\230\270 \354\266\224\352\260\200\355\225\230\352\270\260.md"

diff --git "a/JHLEE325/202510/31 BOJ G3 \352\264\204\355\230\270 \354\266\224\352\260\200\355\225\230\352\270\260.md" "b/JHLEE325/202510/31 BOJ G3 \352\264\204\355\230\270 \354\266\224\352\260\200\355\225\230\352\270\260.md"
new file mode 100644
index 00000000..7d42b432
--- /dev/null
+++ "b/JHLEE325/202510/31 BOJ G3 \352\264\204\355\230\270 \354\266\224\352\260\200\355\225\230\352\270\260.md"	
@@ -0,0 +1,48 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int N;
+    static ArrayList<Integer> nums = new ArrayList<>();
+    static ArrayList<Character> ops = new ArrayList<>();
+    static int answer = Integer.MIN_VALUE;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        N = Integer.parseInt(br.readLine());
+        String str = br.readLine();
+
+        for (int i = 0; i < N; i++) {
+            char c = str.charAt(i);
+            if (i % 2 == 0) nums.add(c - '0');
+            else ops.add(c);
+        }
+
+        dfs(0, nums.get(0));
+        System.out.println(answer);
+    }
+
+    static void dfs(int idx, int sum) {
+        if (idx >= ops.size()) {
+            answer = Math.max(answer, sum);
+            return;
+        }
+
+        int cur = calc(sum, ops.get(idx), nums.get(idx + 1));
+        dfs(idx + 1, cur);
+
+        if (idx + 1 < ops.size()) {
+            int next = calc(nums.get(idx + 1), ops.get(idx + 1), nums.get(idx + 2));
+            int cur2 = calc(sum, ops.get(idx), next);
+            dfs(idx + 2, cur2);
+        }
+    }
+
+    static int calc(int a, char op, int b) {
+        if (op == '+') return a + b;
+        else if (op == '-') return a - b;
+        else return a * b;
+    }
+}
+```