Submission #612444

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
612444	2022-07-29 15:07:28	Jomnoi	Triple Jump (JOI19_jumps)	C++17	100 / 100	1127 ms	91736 KiB

jumps

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 MAX_N = 5e5 + 5;
const int MAX_Q = 5e5 + 5;
const int INF = 1e9 + 7;
int A[MAX_N];
int L[MAX_Q], R[MAX_Q], ans[MAX_Q];
vector <int> queries[MAX_N], updates[MAX_N];
struct Node {
    int ans, maxL, maxR;
    Node() {}
    Node(int a, int ml, int mr) : ans(a), maxL(ml), maxR(mr) {}
    Node operator+(const Node &o) const {
        int ans_, maxL_, maxR_;
        ans_ = max({ans, o.ans, maxL + o.maxR});
        maxL_ = max(maxL, o.maxL);
        maxR_ = max(maxR, o.maxR);
        return Node(ans_, maxL_, maxR_);
    }
}tree[4 * MAX_N];
void build(int idx, int l, int r) {
    if(l == r) {
        return void(tree[idx] = Node(-INF, -INF, A[l]));
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54