Submission #589818

#	Time	Username	Problem	Language	Result	Execution time	Memory
589818		tamthegod	Triple Jump (JOI19_jumps)	C++14	100 / 100	900 ms	69492 KiB

jumps

#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, a[maxN], Q;
int res[maxN];
struct TQuery
{
    int l, r, id;
} q[maxN];
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i];
    cin >> Q;
    for(int i=1; i<=Q; i++)
    {
        int l, r;
        cin >> l >> r;
        q[i] = {l, r, i};
    }
}
pair<int, int> st[4 * maxN];
int lazy[4 * maxN];
void down(int id)
{
    int t = lazy[id];
    lazy[id] = 0;
    st[id * 2].fi = max(st[id * 2].fi, st[id * 2].se + t);
    st[id * 2 + 1].fi = max(st[id * 2 + 1].fi, st[id * 2 + 1].se + t);
    lazy[id * 2] = max(lazy[id * 2], t);
    lazy[id * 2 + 1] = max(lazy[id * 2 + 1], t);
}
void build(int id, int l, int r)
{
    if(l == r)
    {
        st[id].se = a[l];
        return;
    }
    int mid = (l + r) / 2;
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
    st[id].fi = st[id].se = max(st[id * 2].se, st[id * 2 + 1].se);
}
void update(int id, int l, int r, int u, int v, int val)
{
    if(l > v || r < u) return;
    if(l >= u && r <= v)
    {
        st[id].fi = max(st[id].fi, st[id].se + val);
        lazy[id] = max(lazy[id], val);
        return;
    }
    down(id);
    int mid = (l + r) / 2;
    update(id * 2, l, mid, u, v, val);
    update(id * 2 + 1, mid + 1, r, u, v, val);
    st[id].fi = max(st[id * 2].fi, st[id * 2 + 1].fi);
}
int get(int id, int l, int r, int u, int v)
{
    if(l > v || r < u) return 0;
    if(l >= u && r <= v) return st[id].fi;
    down(id);
    int mid = (l + r) / 2;
    return max(get(id * 2, l, mid, u, v), get(id * 2 + 1, mid + 1, r, u, v));
}
void Solve()
{
    sort(q + 1, q + Q + 1, [](TQuery p, TQuery q)
    {
        return p.l > q.l;
    });
    build(1, 1, n);
    vector<pair<int, int>> vc;
    stack<int> s;
    for(int i=n; i>=1; i--)
    {
        while(!s.empty() && a[i] >= a[s.top()])
        {
            vc.pb({i, s.top()});
            s.pop();
        }
        if(!s.empty()) vc.pb({i, s.top()});
        s.push(i);
    }
    sort(vc.begin(), vc.end(), greater<pair<int, int>>());
    int p = 1;
    for(int i=1; i<=Q; i++)
    {
        while(p < vc.size() && vc[p].fi >= q[i].l)
        {
            update(1, 1, n, 2 * vc[p].se - vc[p].fi, n, a[vc[p].fi] + a[vc[p].se]);
           // cout << get(1, 1, n, q[i].l, q[i].r) << '\n';
            p++;
        }
        res[q[i].id] = get(1, 1, n, q[i].l, q[i].r);
    }
    for(int i=1; i<=Q; i++) cout << res[i] << '\n';
}
int32_t main()
{
    //freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Compilation message (stderr)

jumps.cpp: In function 'void Solve()':
jumps.cpp:102:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         while(p < vc.size() && vc[p].fi >= q[i].l)
      |               ~~^~~~~~~~~~~

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