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;
int valley[100100],pos;
vector<int>H;
void init(int N, std::vector<int> H_) {
H=H_;
pos=max_element(H.begin(),H.end())-H.begin();
}
int dp[100100];
int max_towers(int l, int r, int D) {
if(l>=pos||r<=pos) return 1;
return 1+(max(H[l],H[r])+D<=H[pos]);
}
# | 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... |