제출 #1051875

#제출 시각아이디문제언어결과실행 시간메모리
1051875kachim2밀림 점프 (APIO21_jumps)C++17
0 / 100
0 ms344 KiB
#include "jumps.h" #include <vector> #include<iostream> using namespace std; std::vector<int> H; vector<int> next; vector<int> prev; void init(int N, std::vector<int> nH) { H = nH; } int minimum_jumps(int A, int B, int C, int D) { return B-A; int mcd = 0; for(int i = C; i <=D; i++){ mcd = max(mcd, H[i]); } int bs = 0; for(int i = B; i >= A; i--){ //cerr << H[i] << ' '; if(H[i]<mcd) bs = max(bs, i); else break; } //cerr << bs << '\n'; int cm = H[bs], cnt = 0; for(int i = bs; i <= D; i++){ if(H[i]>cm) { cnt++; cm = H[i]; if(i>=C) return cnt; } } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...