答案

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
int main(){
ll n;
cin >>n;
ll h = 0;
for (ll i = 0;i<n;i++){
cin >>a[i];
}
for (int i = 0;i<n;i++){
h += 1;
if (h <= a[i]){
cout <<"NO";
return 0;
}
}
cout <<"YES";
}

作为第一道以HJ开头的题目，发个题解/给个面子吧。 上代码

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,sum=0,x;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>x;
        sum++;
        if(sum>x){
            continue;
        }else{
            cout<<"NO";
            return 0;
        }
    }
    cout<<"YES";
    return 0;
}

#include<bits/stdc++.h> using namespace std; int main(){ int n,sum=0,x; cin>>n; for(int i=0;i<n;i++){ cin>>x; sum++; if(sum>x){ continue; }else{ cout<<"NO"; return 0; } } cout<<"YES"; return 0; }

#便民小题解🚀️ 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
int main(){
ll n;
cin >>n;
ll h = 0;
for (ll i = 0;i<n;i++){
cin >>a[i];
}
for (int i = 0;i<n;i++){
h += 1;
if (h <= a[i]){
cout <<"NO";
return 0;
}
}
cout <<"YES";
}
//以为······原因暂时不能编写注释，可以看一下↑一个题解

#include<bits/stdc++.h> using namespace std; const int N=100005; int arr[N]; int n; int main() { cin>>n; for(int i=1;i<=n;i++){ cin>>arr[i]; } for(int i=1;i<=n;i++){ if(arr[i]>=i){ cout<<"NO"; return 0; } } cout<<"YES"; return 0; }