Submission #1293537

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293537		M_SH_O	Triple Jump (JOI19_jumps)	C++20	32 / 100	4093 ms	10320 KiB

jumps

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

const ll INF = 1e18+7;
const int lg = 20;
const ll MOD = 1e9+7;
//const ll MOD2 = 998244353;
//const ll MOD3 = 1e6+3;

mt19937 rng(1488);
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int main() {
    speed;

    ll n;
    cin >> n;
    vll a(n);
    for (int i = 0; i < n; i ++) {
        cin >> a[i];
    }

    vpll v, p;
    for (int i = 0; i < n; i ++) {
        while (v.size() && a[i] > v.back().fr) v.pop_back();
        if (v.size()) p.pb({v.back().se, i});
        while (v.size() && a[i] == v.back().fr) v.pop_back();
        v.pb({a[i], i});
    }
    v.clear();
    for (int i = n-1; i >= 0; i --) {
        while (v.size() && a[i] > v.back().fr) v.pop_back();
        if (v.size()) p.pb({i, v.back().se});
        while (v.size() && a[i] == v.back().fr) v.pop_back();
        v.pb({a[i], i});
    }

    ll q;
    cin >> q;
    while (q --) {
        ll l, r;
        cin >> l >> r;
        l --, r --;
        vll mx(n+7, 0);
        for (int i = r; i >= l; i --) {
            mx[i] = max(mx[i+1], a[i]);
        }

        ll maxl = 0;
        for (auto i : p) {
            if ( l <= i.fr && 2*i.se-i.fr <= r) {
                maxl = max(maxl, a[i.fr]+a[i.se]+mx[2*i.se-i.fr]);
            }
        }

        cout << maxl << endl;
    }


}

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