[Silver I] Title: 포도주 시식, Time: 132 ms, Memory: 16332 KB -BaekjoonHub

Author: chech2

백준/Silver/2156. 포도주 시식/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 16600 KB, 시간: 160 ms
+메모리: 16332 KB, 시간: 132 ms
 
 ### 분류
 
 다이나믹 프로그래밍
 
 ### 제출 일자
 
-2024년 8월 6일 16:08:52
+2025년 12월 21일 20:18:56
 
 ### 문제 설명
 

백준/Silver/2156. 포도주 시식/포도주 시식.java

@@ -1,35 +1,32 @@
-import java.io.BufferedReader;
-import java.io.InputStreamReader;
-import java.util.Arrays;
+import java.io.*;
+import java.util.*;
 
 public class Main {
 
     static int n, ans;
-    static int[] grape;
+    static int[] wine;
     static int[][] dp;
+
     static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
     public static void main(String[] args) throws Exception{
-        input();
-        System.out.println(recur(0, 0));
-    }
+        n = Integer.parseInt(br.readLine());
+        wine = new int[n];
+        dp = new int[n][3];
 
-    public static int recur(int cnt, int seleted){
-        if(cnt == n){
-            return 0 ;
+        for(int i = 0; i < n; i++){
+            wine[i] = Integer.parseInt(br.readLine());
+            Arrays.fill(dp[i], -1);
         }
-        if(dp[cnt][seleted] != -1) return dp[cnt][seleted];
-        dp[cnt][seleted]= recur(cnt + 1, 0);
-        if(seleted < 2) dp[cnt][seleted] = Math.max(dp[cnt][seleted], recur(cnt + 1, seleted + 1) + grape[cnt]);
-        return dp[cnt][seleted];
+        System.out.println(recur(0, 0));
     }
 
-    public static void input() throws Exception{
-        n = Integer.parseInt(br.readLine());
-        grape = new int[n];
-        dp = new int[n][3];
-        for (int i = 0; i < n; i++) {
-            grape[i] = Integer.parseInt(br.readLine());
-            Arrays.fill(dp[i], -1);
+    public static int recur(int cnt, int seq){
+        if(cnt == n)return 0 ;
+        if(dp[cnt][seq] != -1) return dp[cnt][seq];
+
+        if(seq < 2){
+            dp[cnt][seq] = Math.max(recur(cnt + 1, seq + 1) + wine[cnt], dp[cnt][seq]);
         }
+        return  dp[cnt][seq] = Math.max(recur(cnt + 1, 0), dp[cnt][seq]);
     }
-}
+}