1 #include <cstdio>
 2 #include <queue>
 3 #include <algorithm>
 4 #include <cstring>
 5
 6 inline int Read(){
 7     int x = 0,f = 1;
 8     char ch = getchar();
 9     while(ch < '0' || ch >'9'){
10         if(ch=='-') f = -1;
11         ch = getchar();
12     }
13     while(ch >= '0' && ch <= '9'){
14         x = x*10 + ch - '0';
15         ch = getchar();
16     }
17     return x*f;
18 }
19
20 int dp[1000005],num[1000005];
21 int n,m;
22 std::deque<int>Q;
23
24 int GetOut(int k){
25     memset(dp,0x3f3f3f3f,sizeof(dp));
26     Q.clear();
27     Q.push_back(1);
28     dp[1]=0;
29     for(int i=2;i<=n;i++){
30         //printf("fuck\n");
31         while(!Q.empty() && Q.front() < i - k) Q.pop_front();
32         dp[i] = dp[Q.front()] + (num[i] >= num[Q.front()]);
33         //printf("fuck\n");
34         while( !Q.empty() ){
35             if(dp[i] == dp[Q.back()]){
36                 if(num[i] > num[Q.back()]){
37                      Q.pop_back();
38                 }
39                 else break;
40             }
41             else{
42                 if(dp[i] < dp[Q.back()]){
43                     Q.pop_back();
44                 }
45                 else break;
46             }
47         }
48         Q.push_back(i);
49         //printf("%d\n",i);
50     }
51     return dp[n];
52 }
53
54 void init(){
55     n = Read();
56     for(int i=1;i<=n;i++){
57         num[i] = Read();
58     }
59     m = Read();
60     for(int i=1;i<=m;i++){
61         printf("%d\n",GetOut( Read() ));
62     }
63     return;
64 }
65
66 int main(){
67     init();
68     return 0;
69 }