Create BackJoon2579.java

KHJ_Root/백준문제/BackJoon2579.java

@@ -0,0 +1,27 @@
+import java.util.Scanner;
+
+public class Main {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt(); // 계단 개수
+        int[] score = new int[n + 1];
+        int[] dp = new int[n + 1];
+
+        for (int i = 1; i <= n; i++) {
+            score[i] = sc.nextInt();
+        }
+
+        // 초기값 설정
+        dp[1] = score[1];
+        if (n >= 2) dp[2] = score[1] + score[2];
+        if (n >= 3) dp[3] = Math.max(score[1] + score[3], score[2] + score[3]);
+
+        // 점화식 적용
+        for (int i = 4; i <= n; i++) {
+            dp[i] = Math.max(dp[i-2], dp[i-3] + score[i-1]) + score[i];
+        }
+
+        System.out.println(dp[n]);
+    }
+}