제출 #887267

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887267		alex_2008	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	60 ms	97372 KiB

sortbooks

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <fstream>
#include <bitset>
typedef long long ll;
using namespace std;
const int N = 5e3 + 10;
int a[N], l[N];
int ans[N][N];
int main() {
	int n, q;
	cin >> n >> q;
	a[0] = 1e9 + 10;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		l[i] = i - 1;
		while (a[i] >= a[l[i]]) {
			l[i] = l[l[i]];
		}
	}
	for (int i = 1; i <= n; i++) {
		ans[i][i] = 0;
		for (int j = i + 1; j <= n; j++) {
			ans[i][j] = ans[i][j - 1];
			if (l[j] >= i) ans[i][j] = max(ans[i][j], a[l[j]] + a[j]);
		}
	}
	while (q--) {
		int l, r, k;
		cin >> l >> r >> k;
		if (ans[l][r] <= k) cout << "1\n";
		else cout << "0\n";
	}
}

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