#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
ll ma=0, pos=0;
vector<int>h;
void init(int N, std::vector<int> H) {
for(ll i=0; i<N; i++)
{
if(ma<1ll*H[i])
{
ma=H[i];
pos=i;
}
}
h=H;
}
int max_towers(int L, int R, int D) {
if(L<pos&&pos<R&&h[L]<=h[pos]-D&&h[R]<=h[pos]-D)
return 2;
return 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... |