Submission #1142445

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142445		Noproblem29	Triple Jump (JOI19_jumps)	C++20	32 / 100	4094 ms	34884 KiB

jumps

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=5e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n,q;
int a[N];
int sp[N][19];
int lg[N];
void build(){
    lg[1]=0;
    for(int i=2;i<=n;i++){
        lg[i]=(lg[i/2]+1);
    }
    for(int i=1;i<=n;i++){
        sp[i][0]=a[i];
    }
    for(int j=1;j<=lg[n];j++){
        for(int i=1;i+(1ll<<j)-1<=n;i++){
            sp[i][j]=max(sp[i][j-1],sp[i+(1ll<<(j-1))][j-1]);
        }
    }
}
int get(int l,int r){
    int k=lg[r-l+1];
    return max(sp[l][k],sp[r-(1<<k)+1][k]);
}
void test(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    build();
    // a<b<c 
    // b-a<=c-b
    // b*2-c<=a
    // 2*b-a<=c
    // 2*b<=c+a
    cin>>q;
    for(int l,r;q--;){
        cin>>l>>r;
        // if(r-l+1<=2){
        //     cout<<0<<'\n';
        //     continue;
        // }
        stack<int>s;
        int ans=0;
        for(int i=r;i>=l;i--){
            while(s.size()){
                int j=s.top();
                // cout<<i<<' '<<j<<'\n';
                if(j*2-i<=r){
                    ans=max(ans,a[i]+a[j]+get(j*2-i,r));
                }
                if(a[i]<a[j])break;
                s.pop();
            }
            s.push(i);
        }
        cout<<ans<<'\n';
    }

}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

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