제출 #890018

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890018		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3017 ms	2140 KiB

sortbooks

#include <bits/stdc++.h>
#define ll long long
#define inf INFINITY
#define pb push_back
#define F first
#define S second
const int N = 1e5+1;
using namespace std;
ll n,q,a[N],l,r,k,mx,mn;
pair <int,int> b[N];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	while(q--){
		cin>>l>>r>>k;
		for(int i=l;i<=r;i++){
			b[i-l+1].F=a[i];
			b[i-l+1].S=i;
		}
		sort(b+1,b+r-l+2);
		for(int i=l;i<=r;i++){
			for(int j=l;j<=b[i-l+1].S;j++){
				mx=max(mx,abs(b[i-l+1].F-a[j]));
			}
		}
		if(mx>k)cout<<0<<'\n';
		else cout<<1<<'\n';
	}
  return 0;
}

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