제출 #1256597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1256597		Bahamin	3단 점프 (JOI19_jumps)	C++20	100 / 100	698 ms	82092 KiB

jumps

#include <bits/stdc++.h>

using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }

#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define sui cout.tie(NULL); cin.tie(NULL); ios_base::sync_with_stdio(false)
#define lid id << 1
#define rid id << 1 | 1
#define mid ((r + l) >> 1)
const int MAX_N = 5e5 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;
const int LOG = 30;

int seg[MAX_N << 2];
int seg2[MAX_N << 2];
int seg3[MAX_N << 2];
int ops[MAX_N << 2];
bool have[MAX_N << 2];
int n;
int a[MAX_N];

void build(int l, int r, int id)
{
    if (l == r - 1)
    {
        seg[id] = seg2[id] = a[l];
        return;
    }
    build(l, mid, lid);
    build(mid, r, rid);
    seg[id] = max(seg[lid], seg[rid]);
    seg2[id] = max(seg2[lid], seg2[rid]);
}

void move(int l, int r, int id)
{
    if (l == r - 1 || !have[id]) return;
    seg[lid] = seg2[lid] + ops[id];
    seg[rid] = seg2[rid] + ops[id];
    seg3[lid] = seg3[rid] = ops[id];
    ops[lid] = ops[rid] = ops[id];
    have[lid] = have[rid] = true;
    have[id] = false;
}

void upd(int s, int t, int x, int l, int r, int id)
{
    if (s >= t) return;
    move(l, r, id);
    if (s <= l && t >= r)
    {
        seg[id] = seg2[id] + x;
        seg3[id] = x;
        ops[id] = x;
        have[id] = true;
        return;
    }
    if (s < mid) upd(s, t, x, l, mid, lid);
    if (t > mid) upd(s, t, x, mid, r, rid);
    seg[id] = max(seg[lid], seg[rid]);
    seg3[id] = max(seg3[lid], seg3[rid]);
}

int get(int s, int t, int l, int r, int id)
{
    move(l, r, id);
    if (s <= l && t >= r) return seg[id];
    if (s >= r || t <= l) return 0;
    return max(get(s, t, l, mid, lid), get(s, t, mid, r, rid));
}

int get2(int x, int l, int r, int id)
{
    move(l, r, id);
    if (seg3[id] < x) return n;
    if (l == r - 1) return l;
    int ind = get2(x, l, mid, lid);
    if (ind == n) return get2(x, mid, r, rid);
    return ind;
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<pair<int, int>> qs[n];
    int q;
    cin >> q;
    int ans[q];
    for (int i = 0; i < q; i++)
    {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        qs[l].push_back(make_pair(r, i));
    }
    vector<int> st[n];
    vector<int> al;
    for (int i = 0; i < n; i++)
    {
        while (al.size() && a[al.back()] < a[i]) al.pop_back();
        if (al.size()) st[al.back()].push_back(i);
        al.push_back(i);
    }
    build(0, n, 1);
    al.clear();
    for (int i = n - 1; i >= 0; i--)
    {
        while (al.size() && a[al.back()] < a[i]) al.pop_back();
        if (al.size()) st[i].push_back(al.back());
        for (int x : st[i]) upd(2 * x - i, get2(a[x] + a[i], 0, n, 1), a[x] + a[i], 0, n, 1);
        for (auto x : qs[i]) ans[x.second] = get(i + 2, x.first + 1, 0, n, 1); 
        al.push_back(i);
    }
    for (int i = 0; i < q; i++) cout << ans[i] << "\n";
}

int main() {
    sui;
    int tc = 1;
    //cin >> tc;
    for (int t = 1; t <= tc; t++) {
        solve();
    }
}

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