# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168915 | mousebeaver | Triple Jump (JOI19_jumps) | C++20 | 2153 ms | 589824 KiB |
#define ll long long
#include <bits/stdc++.h>
using namespace std;
ll left(ll i)
{return 2*i;}
ll right(ll i)
{return 2*i+1;}
ll query(vector<ll>& s, ll i, ll a, ll b, ll l, ll r)
{
if(l <= a && b <= r)
return s[i];
if(r < a || b < l)
return 0;
ll mid = (a+b)/2;
return max(query(s, left(i), a, mid, l, r), query(s, right(i), mid+1, b, l, r));
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin>>n;
vector<ll> a(n);
for(ll& i : a)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |