#include <bits/stdc++.h>
using namespace std;
#define pii pair < int , int >
#define eb emplace_back
#define pb push_back
#define int long long
#define fi first
#define se second
const int inf = 1e18;
const int sz = 1e6+5;
int ans[sz];
void solve() {
int n,q; cin >> n >> q;
vector<int> v(n+1);
for(int i = 1;i <= n;i++) cin >> v[i];
for(int k = 1;k < sz;k++) {
int res = 0, rn = 0;
bool is = 0;
for(int i = 1;i <= n;i++) {
if(v[i] <= k) {
rn++;
is = 1;
}
else if(is) {
res += rn*(rn+1)/2;
rn = 0;
is = 0;
}
}
res += rn*(rn+1)/2;
ans[k] = res;
}
while(q--) {
int x; cin >> x;
cout << ans[x] << "\n";
}
}
signed main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
int t = 1; //cin >> t;
while(t--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |