This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+1;
int n,q;
int arr[N];
int main(){
ios_base::sync_with_stdio(0),cin.tie(0);
cin >> n >> q;
for(int i=1; i<=n; i++){
cin >> arr[i];
}
while(q--){
int h;
ll ans=0;
cin >> h;
int cnt=0;
for(int i=1; i<=n; i++){
if(arr[i]<h+1)cnt++;
if(arr[i]>=h+1||i==n){
ans+=(cnt*(cnt+1))/2;
cnt=0;
}
}
cout << ans << '\n';
}
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... |