[BAE/<JOON> 문제풀이] 11060. 점프점프

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

11060번: 점프 점프

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> arr, dp;
    int n;
    cin >> n;
    arr.resize(n + 1);
    dp.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    dp[1] = 0;
    for (int i = 2; i <= n; i++) {
        dp[i] = 9999;
        for (int j = 1; j < i; j++) {
            if (j + arr[j] >= i) {
                dp[i] = min(dp[i], dp[j] + 1);
            }
        }
    }
    if (dp[n] == 9999) {
        cout << -1;
        return 0;
    }

    cout << dp[n];
    return 0;
}