제출 #1256680

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

jumps

#include <bits/stdc++.h>

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

typedef long long ll;
typedef long double	ld;
typedef pair<int, int>	pii  ;
typedef pair<ll, ll>	pll  ;
typedef vector<pii>     vii  ;
typedef vector<int>     veci ;
typedef vector<pll>     vll  ;
typedef vector<ll>      vecll;

// find_by_order             order_of_key

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl
#define set_dec(x)	    cout << fixed << setprecision(x);
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r" , stdin) ; freopen("out.txt" , "w" , stdout);
#define lb              lower_bound
#define ub              upper_bound
#define for1(n)         for(int i=1;i<=n;i++)
#define for0(n)         for(int i=0;i<n;i++)
#define forn(n)         for(int i=n;i>0;i--)
#define pq              priority_queue <pii, vector<pii>, greater<pii>>


const int N=1<<19;
int A[N],n,m,k,q;
vector<int>g[N];
vector<pii>vecc[N];

ll seg[N*2],mx[N*2],lz[N*2],ans[N];
void shift(int l,int r,int v){
    if(r-l==1 || lz[v]==0)return;
    seg[v<<1]=max(seg[v<<1],lz[v]+mx[v<<1]);
    seg[v<<1|1]=max(seg[v<<1|1],lz[v]+mx[v<<1|1]);
    lz[v<<1]=max(lz[v<<1],lz[v]);
    lz[v<<1|1]=max(lz[v<<1|1],lz[v]);
    lz[v]=0;
}
void build(int l=1,int r=n+1,int v=1){
    if(r-l==1){
        seg[v]=mx[v]=A[l];
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,v<<1);
    build(mid,r,v<<1|1);
    seg[v]=mx[v]=max(seg[v<<1],seg[v<<1|1]);
}
void upd(int lx,int rx,int x,int l=1,int r=n+1,int v=1){
    shift(l,r,v);
    if(lx>=r || rx<=l)return;
    if(lx<=l && r<=rx){
        seg[v]=max(seg[v],x+mx[v]);
        lz[v]=x;
        return;
    }
    int mid=(l+r)>>1;
    upd(lx,rx,x,l,mid,v<<1);
    upd(lx,rx,x,mid,r,v<<1|1);
    seg[v]=max(seg[v<<1],seg[v<<1|1]);
}
ll get(int lx,int rx,int l=1,int r=n+1,int v=1){
    shift(l,r,v);
    if(lx>=r || rx<=l)return 0;
    if(lx<=l && r<=rx)return seg[v];
    int mid=(l+r)>>1;
    return max(get(lx,rx,l,mid,v<<1),get(lx,rx,mid,r,v<<1|1));
}
int main(){
    fast_io
    cin>>n;
    for1(n)cin>>A[i];
    vector<int>vec;vec.pb(0);A[0]=1e9+10;
    for1(n){
        while(A[vec.back()]<=A[i]){
            g[vec.back()].pb(i);
            vec.pop_back();
        }
        g[vec.back()].pb(i);
        vec.pb(i);
    }
    cin>>m;
    for1(m){
        int l,r;cin>>l>>r;
        vecc[l].pb({r,i});
    }
    build();
    for(int i=n;i>=1;i--){
        for(int x:g[i]){upd(i+(x-i)*2,n+1,A[x]+A[i]);}
        for(pii p:vecc[i])ans[p.S]=get(i,p.F+1);
    }
    for1(m)cout<<ans[i]<<endl;



}

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