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 <bits/stdc++.h>
#include "towers.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
const int N = (int)1e5 + 10;
int h[N];
void init(int n, vector<int> H) {
for(int i = 0 ; i < n; i ++ ){
h[i] = H[i];
}
}
int D;
int fin(int l, int r, int lim){
if(l > r) return 0;
int mx = -1;
for(int i = l; i <= r; i ++ ){
if(h[i] <= lim){
if(mx == -1 || h[i] > h[mx]){
mx = i;
}
}
}
if(mx == -1) return 0;
return max(1, fin(l,mx-1,h[mx]-D) + fin(mx+1,r,h[mx]-D));
}
int max_towers(int L, int R, int delta) {
D = delta;
return fin(L,R,(int)1e9 + 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... |