# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966289 | 42kangaroo | Radio Towers (IOI22_towers) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "towers.h"
#include <vector>
std::vector<int> act;
int maxI = 0;
void init(int N, std::vector<int> H) {
using namespace std;
act = H;
maxI = max_element(act.begin(), act.end()) - act.begin();
}
int max_towers(int L, int R, int D) {
if (maxI < L || maxI > R) return 1;
if (act[maxI] - act[L] >= D && act[maxI] - act[R] >= D )return 2;
return 1;
}