oj.uz

Submission #916464

# Submission time Handle Problem Language Result Execution time Memory
916464 2024-01-26T01:11:44 Z 12345678 Triple Jump (JOI19_jumps) C++17
27 / 100
 24 ms 5724 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=5e5+5;
int n, a[nx], mx[nx], res=-1e9, q, l, r;
stack<int> 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]=-1e9;
    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()&&a[s.top()]<=a[i]) res=max(res, a[s.top()]+a[i]+mx[min(n+1, 2*i-s.top())]), s.pop();
        if (!s.empty()) res=max(res, a[s.top()]+a[i]+mx[min(n+1, 2*i-s.top())]);
        s.push(i);
    }
    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
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4956 KB Output is correct
2 Correct 17 ms 4700 KB Output is correct
3 Correct 19 ms 5724 KB Output is correct
4 Correct 24 ms 4904 KB Output is correct
5 Correct 19 ms 4700 KB Output is correct
6 Correct 15 ms 4192 KB Output is correct
7 Correct 15 ms 3932 KB Output is correct
8 Correct 15 ms 4188 KB Output is correct
9 Correct 16 ms 4444 KB Output is correct

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 -