73 삐약 : 백준 5279| 계단 오르기 [바킹독 문제 풀이|DP|JAVA]

 

https://www.acmicpc.net/problem/2579

 

package BKD_0x10_DP;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class BOJ_5279 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());

        int[] input = new int[n+1];
        int[] dp = new int[n+1];

        for(int i=1;i<=n;i++){
            input[i] = Integer.parseInt(br.readLine());
        }

        dp[1]=input[1];

        if(n>=2){
            dp[2]=input[1]+input[2];
        }

        for(int i=3;i<=n;i++){
            dp[i] = Math.max( dp[i-2], dp[i-3] + input[i-1] ) + input[i];
        }
        System.out.println(dp[n]);

    }
}

 

 

 

참고 url : https://st-lab.tistory.com/132

[백준] 2579번 : 계단 오르기 - JAVA [자바]

 

설명 진짜 잘해주심 최고최고 짱짱맨뿡뿡