feat : 2025-09-12 Baekjoon Silver & Gold question solved.

Author: Hojip-Kim

2025-09-12/김호집/2xn타일링2.java

@@ -0,0 +1,25 @@
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+
+public class Main {
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int n = Integer.parseInt(br.readLine().trim());
+        final int MOD = 10007;
+
+        if (n == 1) {
+            System.out.println(1);
+            return;
+        }
+
+        int[] dp = new int[n + 1];
+        dp[1] = 1;
+        dp[2] = 3;
+
+        for (int i = 3; i <= n; i++) {
+            dp[i] = (dp[i - 1] + 2 * dp[i - 2]) % MOD;
+        }
+
+        System.out.println(dp[n]);
+    }
+}

2025-09-12/김호집/연속합.java

@@ -0,0 +1,20 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int n = Integer.parseInt(br.readLine().trim());
+        int[] arr = new int[n];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) arr[i] = Integer.parseInt(st.nextToken());
+
+        int cur = arr[0];   // i에서 끝나는 최대 연속합
+        int ans = arr[0];   // 전체 최대값
+        for (int i = 1; i < n; i++) {
+            cur = Math.max(arr[i], cur + arr[i]);
+            ans = Math.max(ans, cur);
+        }
+        System.out.println(ans);
+    }
+}

2025-09-12/김호집/포도주 시식.java

@@ -0,0 +1,34 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int n = Integer.parseInt(br.readLine().trim());
+        int[] a = new int[n + 1];
+        for (int i = 1; i <= n; i++) {
+            a[i] = Integer.parseInt(br.readLine().trim());
+        }
+
+        if (n == 1) {
+            System.out.println(a[1]);
+            return;
+        }
+        if (n == 2) {
+            System.out.println(a[1] + a[2]);
+            return;
+        }
+
+        int[] dp = new int[n + 1];
+        dp[1] = a[1];
+        dp[2] = a[1] + a[2];
+
+        for (int i = 3; i <= n; i++) {
+            dp[i] = Math.max(
+                    dp[i - 1],
+                    Math.max(dp[i - 2] + a[i], dp[i - 3] + a[i - 1] + a[i])
+            );
+        }
+        System.out.println(dp[n]);
+    }
+}