Submission #1071276

#TimeUsernameProblemLanguageResultExecution timeMemory
1071276vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
3068 ms4324 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	cin>>n>>m;
	int a[n];
	for(int i=1 ;i<=n ;i++){
		cin>>a[i];
	}
	while(m--){
		int l,r,k; 
		cin>>l>>r>>k;
		int mx=0,id=0;
		for(int i=l ;i<=r ;i++){
			if (mx<a[i]){
				mx=a[i];
				id=i;
			}
		}
		int qwesdasdfkbnfkndb=0;	
		for(int i=id+1 ; i<=r; i++){
			if (mx+a[i]>k){
				qwesdasdfkbnfkndb=1;
				cout<<"0\n";
				i=r+1;
			}
			//cout<<k<<" "<<mx<<" "<<a[i]<<" "<<qwesdasdfkbnfkndb<<" "<<i<<"\n";
		}
		//cout<<mx<<" ";
		if (qwesdasdfkbnfkndb==0){
			cout<<"1\n";
		}
	}
}
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...