#pragma optimization("03")
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
int main()
{
ll n, q, i, maxx, cnt, size;
cin >> n >> q;
vector <ll> a(n);
for (i = 0; i < n; i++)
{
cin >> a[i];
}
vector <ll> b(q);
for (i = 0; i < q; i++)
{
cin >> b[i];
}
for (i = 0; i < q; i++)
{
maxx = b[i], cnt = 0, size = 0;
for (auto x : a)
{
if (x <= maxx)
{
size++;
}
else
{
cnt += (size * (size + 1)) / 2;
size = 0;
}
}
cnt += (size * (size + 1)) / 2;
cout << cnt << endl;
}
return 0;
}
# | 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... |