Submission #1114841

#TimeUsernameProblemLanguageResultExecution timeMemory
1114841AdamGSFire (JOI20_ho_t5)C++17
0 / 100
1052 ms10912 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, q;
    cin>>n>>q;
    vector<long long> vect(n);
    for (long long i=0;i<n;i++) cin>>vect[i];
    long long t;
    cin>>t;
    for (long long i=0;i<t;i++){
        for (long long j=n-2;j>=0;j--){
            if (vect[j]>vect[j+1]) vect[j+1]=vect[j];
        }
    }
    vector<long long> prefSums(n+1);
    for (int i=1;i<=n;i++) prefSums[i]=vect[i-1]+prefSums[i-1];
    for (int qe=0;qe<q;qe++){
        if (qe>0) cin>>t;
        int l, r;
        cin>>l>>r;
        cout<<prefSums[r]-prefSums[l-1]<<'\n';
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...