제출 #434152

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
434152	2021-06-20 15:54:59	dqhungdl	Rainforest Jumps (APIO21_jumps)	C++17	100 / 100	1635 ms	67008 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;
typedef pair<int,int> ii;
const int MAX=2e5+5;
int Lg[MAX],J[MAX][20],JR[MAX][20];
ii f[MAX][20];
ii query(int l,int r) {
  int k=Lg[r-l+1];
  return max(f[l][k],f[r-(1<<k)+1][k]);
}
void init(int N, std::vector<int> H) {
  // Init log
  for(int i=1;i<=N;i++)
    Lg[i]=log2(i);
  // Init RMQ
  for(int i=0;i<N;i++)
    f[i][0]=ii(H[i],i);
  for(int k=1;(1<<k)<=N;k++)
    for(int i=0;i+(1<<k)-1<N;i++)
      f[i][k]=max(f[i][k-1],f[i+(1<<(k-1))][k-1]);
  vector<int> L(N),R(N);
  // Init left
  for(int i=0; i<N;i++) {
    int tmp=i-1;
    while(tmp>=0&&H[tmp]<=H[i])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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