1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20

#include <iostream>
#include <vector>
#include <cmath>

class Solution {
public:
    int climbStairs(int n, std::vector<int>& costs) {
        std::vector<int> dp(n + 1);
        for (int i = 1; i <= n; ++i) {
            int jmp = 0x7fff'ffff;
            for (int j = 1; j <= 3; ++j) {
                if (i >= j) {
                    jmp = std::min(jmp, j * j + dp[i - j]);
                }
            }
            dp[i] = jmp + costs[i - 1];
        }
        return dp.back();
    }
};