제출 #1071752

#제출 시각아이디문제언어결과실행 시간메모리
1071752beaconmc송신탑 (IOI22_towers)C++17
0 / 100
4070 ms1368 KiB
#include "towers.h" #include <bits/stdc++.h> using namespace std; typedef int ll; #define FOR(i,x,y) for(ll i=x; i<y; i++) #define FORNEG(i,x,y) for(ll i=x; i>y; i--) vector<int> towers; int n = 0; void init(int N, std::vector<int> H) { n = N; towers = H; } int max_towers(int L, int R, int D) { ll ans = 1; for (auto&i : towers){ ll maxi = i; ll temp = 0; ll cur = 0; FOR(i,L,R+1){ ll j = towers[i]; if (j <= maxi && cur==0){ cur = 1; temp += 1; } else if (j>=maxi+D && cur==1){ cur = 0; } } ans = max(temp, ans); } 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...