제출 #445447

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
445447	2021-07-18 03:45:51	SirCovidThe19th	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	2490 ms	92408 KiB

sortbooks

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std; 
const int mx = 1e6+5;
int n, m, A[mx], bit[mx], ans[mx]; vector<array<int, 3>> R[mx];
void upd(int i, int val){
    for (; i > 0; i -= i&(-i)) bit[i] = max(bit[i], val);
}
int query(int i){
    int ret = 0;
    for (; i <= n; i += i&(-i)) ret = max(ret, bit[i]);
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> A[i];
    for (int i = 1; i <= m; i++){
        int l, r, k; cin >> l >> r >> k;
        R[r].push_back({l, k, i});
    }stack<int> stk;
    for (int i = 1; i <= n; i++){
        while (!stk.empty() and A[stk.top()] <= A[i]) stk.pop();
        if (!stk.empty()) upd(stk.top(), A[stk.top()]+A[i]);
        for (auto x : R[i]) ans[x[2]] = (query(x[0]) <= x[1]);
        stk.push(i);
    }for (int i = 1; i <= m; i++) cout<<ans[i]<<endl;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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