제출 #1083831

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083831		vjudge1	Triple Jump (JOI19_jumps)	C++17	100 / 100	690 ms	103512 KiB

jumps

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX                     500005

int nArr, numQuery;
int A[MAX];

int ans[MAX];
vector<int> candidates[MAX];
vector<pair<int, int>> Q[MAX];
struct Node{
    int a, f;
    Node(){}
    Node(int _a, int _f): a(_a), f(_f){}

    friend Node operator + (const Node& a, const Node& b){
        Node res;
        res.a = max(a.a, b.a);
        res.f = max(a.f, b.f);
        return res;
    }
};
struct SegmentTree{
    vector<int> lz;
    vector<Node> st;
    int n;
    SegmentTree(int _n = 0){
        this -> n = _n;
        lz.resize((n << 2) + 5, 0);
        st.resize((n << 2) + 5);
    }
    #define lson (nd << 1)
    #define rson (nd << 1 | 1)

    void build(int nd, int l, int r){
        if(l == r){
            st[nd].f = st[nd].a = A[l];
            return;
        }
        int m = (l + r) >> 1;
        build(lson, l, m);
        build(rson, m + 1, r);
        st[nd] = st[lson] + st[rson];
    }

    void pushDown(int nd){
        maximize(lz[lson], lz[nd]);
        maximize(lz[rson], lz[nd]);

        maximize(st[lson].f, st[lson].a + lz[nd]);
        maximize(st[rson].f, st[rson].a + lz[nd]);

        return;
    }
    void upd(int nd, int l, int r, int u, int v, int val){
        if (u > r || v < l) return;
        if (u <= l && v >= r){
            maximize(st[nd].f, st[nd].a + val);
            maximize(lz[nd], val);
            return;
        }
        int m = (l + r) >> 1;
        pushDown(nd);
        upd(lson, l, m, u, v, val);
        upd(rson, m + 1, r, u, v, val);
        st[nd] = st[lson] + st[rson];
    }
    int query(int nd, int l, int r, int u, int v){
        if (u > r || v < l) return 0;
        if (u <= l && v >= r) return st[nd].f;
        int m = (l + r) >> 1;
        pushDown(nd);
        int ql = query(lson, l, m, u, v);
        int qr = query(rson, m + 1, r, u, v);
        return max(ql, qr);
    }

    void upd(int l, int r, int v){
        upd(1, 1, n, l, r, v);
    }

    int query(int l, int r){
        return query(1, 1, n, l, r);
    }
};
void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];
    cin >> numQuery;

    stack<int> st;

    for (int i = nArr; i >= 1; --i){
        while(st.size()){
            candidates[i].emplace_back(st.top());
            if(A[st.top()] > A[i]) break;
            st.pop();
        }
        st.push(i);
    }

    SegmentTree myit(nArr);
    myit.build(1, 1, nArr);

    for (int i = 1; i <= numQuery; ++i){
        int l, r; cin >> l >> r;
        Q[l].emplace_back(r, i);
    }
    for (int l = nArr; l >= 1; --l){
        for (int &r : candidates[l]){
            if (2 * r - l <= nArr){
                assert(2 * r - l > r);
                myit.upd(2 * r - l, nArr, A[l] + A[r]);
            }
        }
        for (pair<int, int>&x : Q[l]){
            ans[x.second] = myit.query(l, x.first);
        }
    }
    for (int i = 1; i <= numQuery; ++i){
        cout << ans[i] << "\n";
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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