（玄关）红名蒟蒻求条橙题

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug() puts("I WILL AK")
#define N 1000007
int a[N],dp[N],n,q;
int que[N],ll,rr;
inline int rd(){
	int ans=0,w=0;
	char ch=getchar();
	while (ch<'0'||ch>'9'){
		w|=ch=='-',ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
	}
	return w?-ans:ans;
}
inline void wr(int x){
	if(x<0)
		putchar('-'),x=-x;
	if(x<=9){
		putchar(x+'0');
		return;
	}
	wr(x/10);
	putchar(x%10+'0');
}
signed main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=rd();
	for(int i=1;i<=n;++i){
		a[i]=rd();
	}
	q=rd();
	while(q--){
		int x=rd();
		ll=rr=1;
		dp[rr]=1;
		for(int i=2;i<=n;++i){
			while(ll<=rr&&i-que[ll]>x){//弹出
				ll++;
			}
			dp[i]=dp[que[ll]]+(a[que[ll]]<=a[i]);
			while(ll<=rr&&(dp[que[rr]]>dp[i]||(dp[que[rr]]==dp[i]&&a[que[rr]]<=a[i]))){
				rr--;
			}
			que[++rr]=i;
		}
		wr(dp[n]);
		putchar('\n');
	}
	return 0;
}