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>
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> h;
int ans = 0;
void init(int N, std::vector<int> H) {
n = N;
h = H;
}
void seg(int l, int r, int d){
if(l == r) {
ans++; return;
}
else if(l>r) return;
int mx = -1; int ind = -1;
for(int i = l; i<=r; i++){
if(mx<h[i]){
mx = h[i];
ind = i;
}
}
bool band = true;
for(int i = l; i<=r; i++){
if(i == ind) continue;
if(h[i]>mx-d){
band = false;
}
}
if(band) {
seg(l,ind-1,d);
seg(ind+1,r,d);
}
}
int max_towers(int L, int R, int D) {
ans = 0;
seg(L,R,D);
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... |