From 0827410eaf6485965e908b822665651480c49dd0 Mon Sep 17 00:00:00 2001 From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com> Date: Sat, 24 Jan 2026 14:06:06 +0900 Subject: [PATCH] =?UTF-8?q?[20260124]=20BOJ=20/=20G3=20/=20=EC=B9=B4?= =?UTF-8?q?=EB=93=9C=20=EA=B2=8C=EC=9E=84=20/=20=ED=95=9C=EC=A2=85?= =?UTF-8?q?=EC=9A=B1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...4\353\223\234 \352\262\214\354\236\204.md" | 54 +++++++++++++++++++ 1 file changed, 54 insertions(+) create mode 100644 "Ukj0ng/202601/24 BOJ G3 \354\271\264\353\223\234 \352\262\214\354\236\204.md" diff --git "a/Ukj0ng/202601/24 BOJ G3 \354\271\264\353\223\234 \352\262\214\354\236\204.md" "b/Ukj0ng/202601/24 BOJ G3 \354\271\264\353\223\234 \352\262\214\354\236\204.md" new file mode 100644 index 00000000..a94b5fa3 --- /dev/null +++ "b/Ukj0ng/202601/24 BOJ G3 \354\271\264\353\223\234 \352\262\214\354\236\204.md" @@ -0,0 +1,54 @@ +``` +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[][] dp; + private static int[] arr; + private static int N; + + public static void main(String[] args) throws IOException { + int T = Integer.parseInt(br.readLine()); + + while (T-->0) { + init(); + int answer = DP(1, N, true); + bw.write(answer + "\n"); + } + bw.flush(); + bw.close(); + br.close(); + } + + private static void init() throws IOException { + N = Integer.parseInt(br.readLine()); + arr = new int[N+1]; + dp = new int[N+1][N+1]; + + StringTokenizer st = new StringTokenizer(br.readLine()); + + for (int i = 1; i <= N; i++) { + arr[i] = Integer.parseInt(st.nextToken()); + Arrays.fill(dp[i], -1); + } + } + + private static int DP(int left, int right, boolean isGeunWoo) { + if (left > right) return 0; + + if (dp[left][right] != -1) return dp[left][right]; + + if (isGeunWoo) { + int pickLeft = arr[left] + DP(left+1, right, false); + int pickRight = arr[right] + DP(left, right-1, false); + return dp[left][right] = Math.max(pickLeft, pickRight); + } else { + int pickLeft = DP(left+1, right, true); + int pickRight = DP(left, right-1, true); + return dp[left][right] = Math.min(pickLeft, pickRight); + } + } +} +```