bfd40e730194f636990342ebb8801922c0f78bf7a408fe7f06e016505a019258
// https://szkopul.edu.pl/problemset/problem/Vtr5pP-RRtjqnivWocv8xaad/site/?key=statement
// OIG XIV (2 etap) dzień próbny
#include <iostream>
constexpr int sizik = 1000 * 1000;
int arr[sizik];
int ans[sizik];
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
std::cout.tie(0);
int n;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> arr[i];
}
int curr_size = 1;
ans[1] = n;
for (int i = 1; i < n; i++) {
if (arr[i] > arr[i - 1]) {
curr_size++;
} else {
for (int i = curr_size; i > 1; i--) {
ans[i] += curr_size - i + 1;
}
curr_size = 1;
}
}
for (int i = curr_size; i > 1; i--) {
ans[i] += curr_size - i + 1;
}
int q;
std::cin >> q;
for (int i = 0; i < q; i++) {
int a;
std::cin >> a;
std::cout << ans[a] << '\n';
}
return 0;
}