class Solution {
public:
    bool canJump(int A[], int n) {
        if(n<=1)
            return true;
        
        int reach = 1;
        for(int i=0;i<reach&&reach<n;++i){
            reach = max(reach,i+1+A[i]);
        }
        
        return reach >= n;
    }
};