제출 #1074797

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1074797		LOLOLO	Triple Jump (JOI19_jumps)	C++17	100 / 100	723 ms	104308 KiB

jumps

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           s     second
#define           f     first
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 5e5 + 10;
struct node{
    ll a = 0, b = 0;
};

ll a[N];
node seg[N * 4];
ll laz[N * 4];

void build(int id, int l, int r) {
    if (l == r) {
        seg[id].a = a[l];
        seg[id].b = a[l];
        return;
    }

    int m = (l + r) / 2;
    build(id * 2, l, m);
    build(id * 2 + 1, m + 1, r);
    seg[id].a = max(seg[id * 2].a, seg[id * 2 + 1].a);
    seg[id].b = max(seg[id * 2].b, seg[id * 2 + 1].b);
}

void push(int id) {
    ll t = laz[id];
    laz[id * 2] = max(laz[id * 2], t);
    laz[id * 2 + 1] = max(laz[id * 2 + 1], t);
    seg[id * 2].b = max(seg[id * 2].a + t, seg[id * 2].b);
    seg[id * 2 + 1].b = max(seg[id * 2 + 1].a + t,seg[id * 2 + 1].b);
}

void upd(int id, int l, int r, int u, int v, ll val) {
    if (l > v || r < u)
        return;

    if (l >= u && r <= v) {
        laz[id] = max(laz[id], val);
        seg[id].b = max(seg[id].b, seg[id].a + val);
        return;
    }

    push(id);
    int m = (l + r) / 2;
    upd(id * 2, l, m, u, v, val);
    upd(id * 2 + 1, m + 1, r, u, v, val);
    seg[id].a = max(seg[id * 2].a, seg[id * 2 + 1].a);
    seg[id].b = max(seg[id * 2].b, seg[id * 2 + 1].b);
}

ll get(int id, int l, int r, int u, int v) {
    if (l > v || r < u)
        return 0;

    if (l >= u && r <= v)
        return seg[id].b;

    push(id);
    int m = (l + r) / 2;
    return max(get(id * 2, l, m, u, v), get(id * 2 + 1, m + 1, r, u, v)); 
}

vector <int> change[N];
vector <pair <int, int>> ask[N];
ll ans[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

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

    build(1, 1, n);
    stack <int> st;

    for (int i = n; i >= 1; i--) {
        while (sz(st)) {
            int t = st.top();
            change[i].pb(t);
            if (a[i] <= a[t])
                break;

            st.pop();
        }

        st.push(i);
    }

    int q;
    cin >> q;

    for (int i = 0; i < q; i++) {
        int l, r;
        cin >> l >> r;
        ask[l].pb({r, i});
    }

    for (int i = n; i >= 1; i--) {
        for (auto x : change[i]) {
            if (x * 2 - i <= n) {
                upd(1, 1, n, x * 2 - i, n, a[i] + a[x]);
            }
        }

        for (auto x : ask[i]) {
            ans[x.s] = max(ans[x.s], get(1, 1, n, i, x.f));
        }
    }

    for (int i = 0; i < q; i++) 
        cout << ans[i] << "\n";

    return 0;
}

// b - a <= c - b
// tinh so o (x, y) sao cho
// min(abs(x - x1), abs(y - y1))

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