Submission #750604

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
750604	2023-05-29 21:51:11	snpmrnhlol	Rainforest Jumps (APIO21_jumps)	C++17	48 / 100	1313 ms	50504 KiB

jumps

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int K = 20;
int v[N + 2];
int l[N + 2][K];
int r[N + 2][K];
int p[N + 2][K];
stack <int> stk;
int en;
void init(int n, std::vector<int> H) {
    int i,j;en = n;
    for(i = 1;i <= n;i++){
        v[i] = H[i - 1];
    }
    r[n + 1][0] = n + 1;
    l[0][0] = 0;
    for(i = 1;i <= n;i++){
        while(!stk.empty() && v[stk.top()] < v[i]){
            r[stk.top()][0] = i;stk.pop();
        }
        stk.push(i);
    }
    while(!stk.empty()){
        r[stk.top()][0] = n + 1;
        stk.pop();
    }
    for(i = n;i >= 1;i--){
        while(!stk.empty() && v[stk.top()] < v[i]){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 23 / 23
• Subtask 6: 21 / 21
• Subtask 7: 0 / 19