[백준] 2579 계단 오르기 c++

 

문제 링크 https://www.acmicpc.net/problem/2579

Code

#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
const int MAX = 301;
int n;
int stair[MAX];
int dp[MAX];
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> stair[i];
    }
    //dp배열 초기화
    dp[0] = stair[0];
    dp[1] = stair[0] + stair[1];
    dp[2] = max(stair[0], stair[1]) + stair[2];
 
    for (int i = 3; i < n; i++) {
        dp[i] = max(dp[i - 3] + stair[i - 1], dp[i - 2]) + stair[i];
    }
    cout << dp[n - 1];
}