2579 : Climbing stairs (Dynamic Programming) [C,C++]

This game has three rules as you know.

1. Stairs can be climbed one step at a time or two steps at a time. That is, by stepping on one stair, you can go up to the next stair, then the next stair.

2. You should not step on all three consecutive stairs. However, the starting point is not included in the stairs.

3. The last arriving stairs must be stepped on.

In other words,

rule 2, If you have climbed two stairs in succession, the next action must be a 'jump'.

rule 3, The maximum value is the value of the last step.

The most important thing to solve this problem is to store two values in one step because there is a 'jump' variable. 

Therefore, we must use a dynamic two-dimensional array.

You can get the maximum value by storing the values of 'jump' and successive steps.

<pseudo code>

*Source of the problem = https://www.acmicpc.net/problem/2579

*문제 출처 : BAEKJOON ONLINE JUDGE