Submission #585775

#	Time	Username	Problem	Language	Result	Execution time	Memory
585775		zaneyu	Triple Jump (JOI19_jumps)	C++14	100 / 100	1421 ms	113664 KiB

jumps

/*input
5
5 2 1 5 3
3
1 4
2 5
1 5
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
int arr[maxn];
vector<pii> up[maxn],qq[maxn];
struct node{
    int ma=0,mb=0,ans=0;
}seg[4*maxn];
node merge(node a,node b){
    node c;
    c.ans=max({a.ans,b.ans,a.ma+b.mb});
    c.ma=max(a.ma,b.ma);
    c.mb=max(a.mb,b.mb);
    return c;
}
void build(int idx,int l,int r){
    int mid=(l+r)/2;
    seg[idx].mb=arr[l];
    if(l==r) return;
    build(idx*2,l,mid),build(idx*2+1,mid+1,r);
    seg[idx]=merge(seg[idx*2],seg[idx*2+1]);
    //cout<<l<<' '<<r<<' '<<seg[idx].mb<<'\n';
}
void upd(int idx,int l,int r,int p,int x){
    if(r<p or l>p) return;
    if(l==r){
        MXTO(seg[idx].ma,x);
        MXTO(seg[idx].ans,x+seg[idx].mb);
        return;
    }
    int mid=(l+r)/2;
    upd(idx*2,l,mid,p,x),upd(idx*2+1,mid+1,r,p,x);
    seg[idx]=merge(seg[idx*2],seg[idx*2+1]);
}
node query(int idx,int l,int r,int ql,int qr){
    if(ql<=l and r<=qr) return seg[idx];
    int mid=(l+r)/2;
    if(qr<=mid) return query(idx*2,l,mid,ql,qr);
    if(ql>mid) return query(idx*2+1,mid+1,r,ql,qr);
    return merge(query(idx*2,l,mid,ql,qr),query(idx*2+1,mid+1,r,ql,qr));
}
int ans[maxn];
int32_t main(){
    int n;
    cin>>n;
    REP(i,n) cin>>arr[i];
    vector<int> v;
    vector<pii> cand;
    REP(i,n){
        while(sz(v) and arr[v.back()]<=arr[i]) cand.pb({v.back(),i}),v.pop_back();
        if(sz(v)) cand.pb({v.back(),i});
        v.pb(i);
    }
    for(auto x:cand) if(2*x.s-x.f<n) up[x.f].pb({2*x.s-x.f,arr[x.f]+arr[x.s]});
    int q;
    cin>>q;
    REP(i,q){
        int l,r;
        cin>>l>>r;
        --l,--r;
        qq[l].pb({r,i});
    }
    build(1,0,n-1);
    for(int i=n-1;i>=0;i--){
        for(auto x:up[i]) upd(1,0,n-1,x.f,x.s);
        for(auto x:qq[i]){
            ans[x.s]=query(1,0,n-1,i,x.f).ans;
        }
    }
    REP(i,q) cout<<ans[i]<<'\n';
}

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