#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int i;
vector<int> h;
void init(int N, std::vector<int> H) {
while (i+1 < N && H[i] < H[i+1]) i++;
for (int j=0; j<N; j++) h.pb(H[j]);
}
int max_towers(int L, int R, int D) {
if (R<=i || L>=i) return 1;
int ans = 0;
if (h[L] <= h[i]-D) ans++;
if (h[R] >= h[i]-D) ans++;
return max(ans, 1);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |