제출 #1234560

#제출 시각아이디문제언어결과실행 시간메모리
1234560Ghulam_Junaid송신탑 (IOI22_towers)C++20
23 / 100
4061 ms1568 KiB
#include <bits/stdc++.h> #include "towers.h" using namespace std; int k; vector<int> h; void init(int n, vector<int> H) { h = H; } int max_towers(int L, int R, int D) { int ans = 1; int last = L; int mx = 0; for (int i = L + 1; i <= R; i ++){ mx = max(mx, h[i]); if (h[last] + D <= mx and h[i] + D <= mx){ last = i; mx = 0; ans++; continue; } if (h[last] > h[i]){ last = i; mx = 0; } } return ans; }
#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...