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 <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 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... |