Educational Codeforces Round 19 E. Array Queries

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps  1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

const int maxn = 1e5+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n,a[maxn],m;
int dp[maxn][325];
void solve(){
    // cout<<sqrt(1e5)<<endl;
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    scanf("%d",&m);
    int nn=sqrt(n);
    for(int i=n;i>=1;i--){
        for(int j=1;j<=nn;j++){
            int to=i+a[i]+j;
            if(to>n) dp[i][j]=1;
            else dp[i][j]=dp[to][j]+1;
        }
    }
    while(m--){
        int p,k;
        scanf("%d%d",&p,&k);
        if(k<=nn) {
            // cout<<dp[p][k]<<endl;
            printf("%d\n",dp[p][k]);
        }
        else{
            int now=p,res=0;
            while(now<=n){
                now+=a[now]+k;
                ++res;
            } 
            printf("%d\n",res);
            // cout<<res<<endl;
        }
    }
    return;
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    //    printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}