BOJ)2579 계단 오르기 (다시보기)

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

#include <iostream> #include <algorithm> using namespace std; int n; int arr[100001]; int dp[500005][3]; void func() { dp[1][0] = 0; dp[1][1] = arr[1]; dp[1][2] = 0; dp[2][0] = arr[1]; dp[2][1] = arr[2]; dp[2][2] = dp[1][1] + arr[2]; for (int i = 3; i <= n; i++) { dp[i][0] = max(dp[i - 1][1], dp[i - 1][2]); //??? dp[i][1] = dp[i - 1][0] + arr[i]; dp[i][2] = dp[i - 1][1] + arr[i]; } } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> arr[i]; } func(); cout << max(dp[n][1], dp[n][2]); }