#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
int n;
vector <int> a;
void init(int N, vector<int> H) {
n = N;
a.resize(n);
for (int i = 0; i < n; i++){
a[i] = H[i];
}
}
int max_towers(int l, int r, int d) {
int ans = 1;
int best = INF;
int mx = -INF;
for (int i = l; i <= r; i++){
if (max(a[i], best) + d <= mx){
ans++;
best = a[i];
mx = -INF;
} else {
best = min(best, a[i]);
mx = max(mx, a[i]);
}
}
return ans;
}
// int main(){
// int n; cin >> n;
// vector <int> A(n);
// for (int i = 0; i < n; i++){
// cin >> A[i];
// }
// init(n, A);
// int q; cin >> q;
// while (q--){
// int l, r, d; cin >> l >> r >> d;
// cout << max_towers(l, r, d) << "\n";
// }
// return 0;
// }
# | 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... |