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;
vector<int> A, B, H;
int k;
int n;
void init(int N, vector<int> h) {
n = N;
k = n - 1;
H = h;
for (int i = 0; i < n - 1; i++) {
if (h[i] < h[i + 1]) {
A.push_back(h[i]);
} else {
k = i;
break;
}
}
for (int i = n - 1; i > 0; i--) {
if (h[i] < h[i - 1]) {
B.push_back(h[i]);
}
}
}
int max_towers(int L, int R, int D) {
int l = upper_bound(A.begin(), A.end(), H[k] - D) - A.begin();
int r = upper_bound(B.begin(), B.end(), H[k] - D) - B.begin();
r = n - r;
int a = max(0, l - L);
int b = max(0, R - r + 1);
if (a > 0 && b > 0) {
return 2;
} else {
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... |