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;
#define int long long
int32_t main(){
multiset<int> ms;
int n,q;
cin>>n>>q;
int s[n+5];
for(int i=1; i<=n; i++) cin>>s[i];
int t[q],l[q],r[q];
for(int i=0; i<q; i++) cin>>t[i]>>l[i]>>r[i];
int val[n];
val[0] = 0;
for(int i=1; i<=t[0]; i++){
ms.insert(s[i]);
val[i] = *ms.rbegin();
}
for(int i=t[0]+1; i<=n; i++){
ms.insert(s[i]);
ms.erase(ms.find(s[i-t[0]]));
val[i] = *ms.rbegin();
}
int p[n+5]; p[0]=0;
for(int i=1; i<=n; i++) p[i]=p[i-1]+val[i];
for(int i=0; i<q; i++){
cout<<(p[r[i]]-p[l[i]-1])<<'\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... |