Submission #1142428

#	Time	Username	Problem	Language	Result	Execution time	Memory
1142428		Noproblem29	Triple Jump (JOI19_jumps)	C++20	19 / 100	320 ms	239448 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=1e5+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 dp[5005][5005];
int mx[5005][5005];
void test(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        mx[i][i]=a[i];
        for(int j=i+1;j<=n;j++){
            mx[i][j]=max(mx[i][j-1],a[j]);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=i+2;j<=n;j++){
            int mid=(i+j)/2;
            dp[i][j]=mx[i+1][mid]+a[i]+a[j];
        }
    }
    for(int len=3;len<=n;len++){
        for(int i=1;i+len-1<=n;i++){
            int j=i+len-1;
            dp[i][j]=max(dp[i][j],dp[i][j-1]);
            dp[i][j]=max(dp[i][j],dp[i+1][j]);
        }
    }
    // 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;
        cout<<dp[l][r]<<'\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: 14 / 14
• Subtask 3: 0 / 27
• Subtask 4: 0 / 54