Submission #889837

#	Time	Username	Problem	Language	Result	Execution time	Memory
889837		rati	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3016 ms	4588 KiB

sortbooks

#include <bits/stdc++.h>

using namespace std;
int m,n;
int ar[1000001];

int main(){
    cin>>n>>m;
    for(int i=0;i<n;i++)    cin>>ar[i];
    for(int i=0;i<m;i++){
        int l,r,k;
        cin>>l>>r>>k;
        int maxdif=0;
        int cur=ar[l-1];
        for(int 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