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>
using namespace std;
const int N=1e6+10;
int arr[N],que[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n,ind,q,sum=0,ans=0;
cin>>n >>q;
for(int i=1;i<=n;i++) cin>>arr[i];
for(int i=1;i<=q;i++) cin>>que[i];
if(n*q>=100000000){
for(int i=1;i<=q;i++){
ind=upper_bound(arr+1,arr+n+1,que[i])-arr;
ind--;
long long ans=((1+ind)*ind)/2;
cout<<ans <<"\n";
}
return 0;
}
for(int i=1;i<=q;i++){
ans=0,sum=0;
for(int j=1;j<=n;j++){
if(que[i]>=arr[j]) sum++;
else sum=0;
ans+=sum;
}
cout<<ans <<"\n";
}
}
# | 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... |