Submission #889847

#	Time	Username	Problem	Language	Result	Execution time	Memory
889847		rati	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++11	0 / 100	3006 ms	9560 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;
long long m,n;
long long ar[10000001];

int main(){
    cin>>n>>m;
    for(long long i=0;i<n;i++) cin>>ar[i];
    for(long long i=0;i<m;i++){
        long long l,r,k;
        cin>>l>>r>>k;
        long long maxdif=0;
        long long cur=ar[l-1];
        for(long long j=l;j<r;j++){
            if(cur>=ar[j]){
                maxdif=max(maxdif,cur+ar[j]);
            }
            else{
                cur=ar[j];
            }
        }
        if(maxdif>k) cout<<0<<endl;
        else cout<<1<<endl;
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23