Submission #834924

#	Time	Username	Problem	Language	Result	Execution time	Memory
834924		maomao90	Triple Jump (JOI19_jumps)	C++17	19 / 100	4057 ms	44636 KiB

jumps

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 500005;

int n;
int a[MAXN];
int q;
vii qry[MAXN];
vi ev[MAXN];
ll ans[MAXN];

ll mx[MAXN];
void updmx(int s, int e, ll x) {
    REP (i, s, e + 1) {
        mxto(mx[i], x);
    }
}
ll qmx(int s, int e) {
    ll res = 0;
    REP (i, s, e + 1) {
        mxto(res, a[i] + mx[i]);
    }
    return res;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
        cin >> a[i];
    }
    REP (j, 1, n + 1) {
        mx[j] = -INF;
    }
    vi stk;
    REP (j, 1, n + 1) {
        while (!stk.empty() && a[stk.back()] < a[j]) {
            ev[stk.back()].pb(j);
            stk.pop_back();
        }
        if (!stk.empty()) {
            ev[stk.back()].pb(j);
        }
        stk.pb(j);
    }
    stk.clear();
    RREP (j, n, 1) {
        while (!stk.empty() && a[stk.back()] < a[j]) {
            ev[j].pb(stk.back());
            stk.pop_back();
        }
        if (!stk.empty()) {
            ev[j].pb(stk.back());
        }
        stk.pb(j);
    }
    cin >> q;
    REP (i, 1, q + 1) {
        int l, r; cin >> l >> r;
        qry[l].pb({r, i});
    }
    RREP (l, n, 1) {
        for (int r : ev[l]) {
            // c - r = r - l
            // c = 2 * r - l
            if (2 * r - l <= n) {
                updmx(2 * r - l, n, a[l] + a[r]);
            }
        }
        for (auto [r, i] : qry[l]) {
            ans[i] = qmx(l, r);
        }
    }
    REP (i, 1, q + 1) {
        cout << ans[i] << '\n';
    }
    return 0;
}

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