c_cpp 到达终点的最小跳跃次数

Posted 2021-05-14

//https://www.geeksforgeeks.org/minimum-number-of-jumps-to-reach-end-of-a-given-array/
#include <iostream>
using namespace std;

int func (int a[], int n) {
    int jumps[n];
    jumps[0]= 0;

    for (int i=1; i<n;i++) {
        jumps[i]= INT_MAX;
        for (int j=0; j<i; j++) {
            if (jumps[j]!= INT_MAX && i<= j+ a[j]) {
                jumps[i]= min(jumps[i], jumps[j]+1);
                break;
            }
        }
    }
    return jumps[n-1];
}

int main() {
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++)
        cin>> a[i];

    cout<< func (a, n);
}