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>
using namespace std;
int n,mid;
vector<int> h;
void init(int N, std::vector<int> H) {
n=N;
h=H;
mid=-1;
for(int i=0;i<n;++i) {
if((i?h[i-1]:0)<h[i] && h[i]>(i+1<n?h[i+1]:0)) {
mid=i;
if(i>0) break;
}
}
}
int max_towers(int L, int R, int D) {
if(h[0]+D<=h[mid] && h[n-1]+D<=h[mid]) 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... |