oj.uz

Submission #916457

# Submission time Handle Problem Language Result Execution time Memory
916457 2024-01-26T01:01:04 Z 12345678 Triple Jump (JOI19_jumps) C++17
0 / 100
 16 ms 6744 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=5e5+5;
ll n, a[nx], mx[nx], res, q, l, r;
stack<ll> s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i];
    mx[n+1]=-2e9;
    for (int i=n; i>=1; i--) mx[i]=max(mx[i+1], a[i]);
    cin>>q>>l>>r;
    for (int i=1; i<=n; i++)
    {
        while (!s.empty()&&s.top()<=a[i]) res=max(res, a[s.top()]+a[i]+mx[min(n+1, (ll)(2*i-s.top()))]), s.pop();
        if (!s.empty()) res=max(res, a[s.top()]+a[i]+mx[min(n+1, (ll)(2*i-s.top()))]);
        s.push(i);
        //cout<<i<<' '<<res<<'\n';
    }
    cout<<res;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 6744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -